./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/functions_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/loop-acceleration/functions_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 3c699f32b26271d9b8672d2685c3f1aa3d3ad54df32baf7d1d77d9a96ddd2517 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 00:03:55,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 00:03:55,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 00:03:55,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 00:03:55,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 00:03:55,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 00:03:55,744 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 00:03:55,746 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 00:03:55,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 00:03:55,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 00:03:55,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 00:03:55,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 00:03:55,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 00:03:55,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 00:03:55,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 00:03:55,761 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 00:03:55,762 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 00:03:55,763 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 00:03:55,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 00:03:55,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 00:03:55,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 00:03:55,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 00:03:55,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 00:03:55,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 00:03:55,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 00:03:55,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 00:03:55,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 00:03:55,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 00:03:55,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 00:03:55,784 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 00:03:55,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 00:03:55,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 00:03:55,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 00:03:55,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 00:03:55,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 00:03:55,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 00:03:55,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 00:03:55,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 00:03:55,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 00:03:55,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 00:03:55,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 00:03:55,794 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:03:55,829 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 00:03:55,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 00:03:55,829 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 00:03:55,830 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 00:03:55,831 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 00:03:55,831 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 00:03:55,832 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 00:03:55,832 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 00:03:55,832 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 00:03:55,832 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 00:03:55,836 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 00:03:55,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 00:03:55,837 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 00:03:55,837 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 00:03:55,837 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 00:03:55,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 00:03:55,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 00:03:55,837 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 00:03:55,838 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 00:03:55,838 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 00:03:55,838 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 00:03:55,838 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 00:03:55,838 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 00:03:55,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 00:03:55,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 00:03:55,839 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 00:03:55,839 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 00:03:55,839 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 00:03:55,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 00:03:55,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 00:03:55,850 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 00:03:55,851 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 00:03:55,851 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 00:03:55,851 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 00:03:55,851 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 00:03:55,852 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 -> 3c699f32b26271d9b8672d2685c3f1aa3d3ad54df32baf7d1d77d9a96ddd2517 [2023-02-18 00:03:56,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 00:03:56,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 00:03:56,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 00:03:56,110 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 00:03:56,111 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 00:03:56,112 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/functions_1-2.c [2023-02-18 00:03:57,284 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 00:03:57,487 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 00:03:57,487 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/functions_1-2.c [2023-02-18 00:03:57,492 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb46d4699/3b6c8fe291e346649761a7d222c0a7d0/FLAGa9a66d893 [2023-02-18 00:03:57,510 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb46d4699/3b6c8fe291e346649761a7d222c0a7d0 [2023-02-18 00:03:57,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 00:03:57,514 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 00:03:57,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 00:03:57,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 00:03:57,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 00:03:57,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 12:03:57" (1/1) ... [2023-02-18 00:03:57,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad2f73b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:57, skipping insertion in model container [2023-02-18 00:03:57,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 12:03:57" (1/1) ... [2023-02-18 00:03:57,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 00:03:57,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 00:03:57,696 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/loop-acceleration/functions_1-2.c[325,338] [2023-02-18 00:03:57,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 00:03:57,719 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 00:03:57,733 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/loop-acceleration/functions_1-2.c[325,338] [2023-02-18 00:03:57,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 00:03:57,753 INFO L208 MainTranslator]: Completed translation [2023-02-18 00:03:57,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:57 WrapperNode [2023-02-18 00:03:57,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 00:03:57,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 00:03:57,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 00:03:57,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 00:03:57,762 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:03:57" (1/1) ... [2023-02-18 00:03:57,770 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:03:57" (1/1) ... [2023-02-18 00:03:57,787 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 28 [2023-02-18 00:03:57,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 00:03:57,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 00:03:57,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 00:03:57,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 00:03:57,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:57" (1/1) ... [2023-02-18 00:03:57,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:57" (1/1) ... [2023-02-18 00:03:57,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:57" (1/1) ... [2023-02-18 00:03:57,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:57" (1/1) ... [2023-02-18 00:03:57,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:57" (1/1) ... [2023-02-18 00:03:57,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:57" (1/1) ... [2023-02-18 00:03:57,822 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:57" (1/1) ... [2023-02-18 00:03:57,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:57" (1/1) ... [2023-02-18 00:03:57,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 00:03:57,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 00:03:57,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 00:03:57,826 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 00:03:57,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:57" (1/1) ... [2023-02-18 00:03:57,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 00:03:57,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:03:57,856 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:03:57,867 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:03:57,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 00:03:57,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 00:03:57,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 00:03:57,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 00:03:57,951 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 00:03:57,953 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 00:03:58,091 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 00:03:58,097 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 00:03:58,112 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 00:03:58,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:03:58 BoogieIcfgContainer [2023-02-18 00:03:58,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 00:03:58,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 00:03:58,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 00:03:58,123 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 00:03:58,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 12:03:57" (1/3) ... [2023-02-18 00:03:58,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b1df5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 12:03:58, skipping insertion in model container [2023-02-18 00:03:58,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 12:03:57" (2/3) ... [2023-02-18 00:03:58,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b1df5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 12:03:58, skipping insertion in model container [2023-02-18 00:03:58,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 12:03:58" (3/3) ... [2023-02-18 00:03:58,131 INFO L112 eAbstractionObserver]: Analyzing ICFG functions_1-2.c [2023-02-18 00:03:58,163 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 00:03:58,170 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-18 00:03:58,233 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 00:03:58,239 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;@38bdda4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 00:03:58,239 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-18 00:03:58,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 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:03:58,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-18 00:03:58,248 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:03:58,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-18 00:03:58,249 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:03:58,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:03:58,253 INFO L85 PathProgramCache]: Analyzing trace with hash 889635821, now seen corresponding path program 1 times [2023-02-18 00:03:58,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:03:58,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970360709] [2023-02-18 00:03:58,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:03:58,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:03:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:03:58,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:03:58,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:03:58,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970360709] [2023-02-18 00:03:58,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970360709] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 00:03:58,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 00:03:58,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 00:03:58,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642324639] [2023-02-18 00:03:58,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 00:03:58,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 00:03:58,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:03:58,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 00:03:58,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 00:03:58,538 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 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) 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:03:58,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:03:58,579 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2023-02-18 00:03:58,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 00:03:58,581 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:03:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:03:58,586 INFO L225 Difference]: With dead ends: 22 [2023-02-18 00:03:58,587 INFO L226 Difference]: Without dead ends: 10 [2023-02-18 00:03:58,589 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:03:58,592 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:03:58,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:03:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-02-18 00:03:58,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2023-02-18 00:03:58,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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:03:58,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2023-02-18 00:03:58,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2023-02-18 00:03:58,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:03:58,628 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2023-02-18 00:03:58,628 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:03:58,629 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2023-02-18 00:03:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-18 00:03:58,629 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:03:58,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 00:03:58,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 00:03:58,631 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:03:58,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:03:58,633 INFO L85 PathProgramCache]: Analyzing trace with hash 294764431, now seen corresponding path program 1 times [2023-02-18 00:03:58,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:03:58,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301378206] [2023-02-18 00:03:58,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:03:58,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:03:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:03:58,816 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:03:58,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:03:58,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301378206] [2023-02-18 00:03:58,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301378206] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:03:58,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987845615] [2023-02-18 00:03:58,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:03:58,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:03:58,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:03:58,821 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:03:58,823 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:03:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:03:58,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 00:03:58,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:03:58,940 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:03:58,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:03:58,966 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:03:58,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987845615] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:03:58,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:03:58,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-02-18 00:03:58,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105357153] [2023-02-18 00:03:58,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:03:58,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 00:03:58,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:03:58,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 00:03:58,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-02-18 00:03:58,970 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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:03:59,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:03:59,018 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2023-02-18 00:03:59,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 00:03:59,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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:03:59,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:03:59,020 INFO L225 Difference]: With dead ends: 17 [2023-02-18 00:03:59,020 INFO L226 Difference]: Without dead ends: 13 [2023-02-18 00:03:59,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2023-02-18 00:03:59,022 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:03:59,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 00:03:59,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-02-18 00:03:59,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-02-18 00:03:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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:03:59,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2023-02-18 00:03:59,027 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2023-02-18 00:03:59,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:03:59,027 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2023-02-18 00:03:59,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 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:03:59,028 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2023-02-18 00:03:59,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-18 00:03:59,028 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:03:59,028 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2023-02-18 00:03:59,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 00:03:59,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:03:59,235 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:03:59,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:03:59,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1489810771, now seen corresponding path program 2 times [2023-02-18 00:03:59,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:03:59,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573823589] [2023-02-18 00:03:59,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:03:59,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:03:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:03:59,494 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:03:59,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:03:59,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573823589] [2023-02-18 00:03:59,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573823589] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:03:59,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487596881] [2023-02-18 00:03:59,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 00:03:59,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:03:59,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:03:59,505 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:03:59,528 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:03:59,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 00:03:59,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:03:59,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-18 00:03:59,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:03:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:03:59,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:03:59,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:03:59,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487596881] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:03:59,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:03:59,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2023-02-18 00:03:59,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291410] [2023-02-18 00:03:59,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:03:59,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 00:03:59,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:03:59,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 00:03:59,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-02-18 00:03:59,747 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 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:04:00,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:04:00,014 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2023-02-18 00:04:00,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 00:04:00,015 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 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:04:00,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:04:00,016 INFO L225 Difference]: With dead ends: 25 [2023-02-18 00:04:00,016 INFO L226 Difference]: Without dead ends: 21 [2023-02-18 00:04:00,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=589, Unknown=0, NotChecked=0, Total=812 [2023-02-18 00:04:00,017 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 32 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 00:04:00,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 36 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 00:04:00,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-18 00:04:00,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-18 00:04:00,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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:04:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2023-02-18 00:04:00,023 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 12 [2023-02-18 00:04:00,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:04:00,023 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2023-02-18 00:04:00,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 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:04:00,024 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2023-02-18 00:04:00,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-18 00:04:00,024 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:04:00,024 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1] [2023-02-18 00:04:00,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 00:04:00,227 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,SelfDestructingSolverStorable2 [2023-02-18 00:04:00,227 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:04:00,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:04:00,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1781144283, now seen corresponding path program 3 times [2023-02-18 00:04:00,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:04:00,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119272094] [2023-02-18 00:04:00,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:04:00,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:04:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:04:00,650 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:04:00,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:04:00,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119272094] [2023-02-18 00:04:00,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119272094] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:04:00,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312698198] [2023-02-18 00:04:00,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 00:04:00,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:04:00,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:04:00,662 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:04:00,666 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:04:00,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-02-18 00:04:00,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:04:00,760 WARN L261 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-18 00:04:00,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:04:00,883 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:04:00,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:04:01,286 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:04:01,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312698198] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:04:01,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:04:01,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2023-02-18 00:04:01,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023355184] [2023-02-18 00:04:01,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:04:01,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-18 00:04:01,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:04:01,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-18 00:04:01,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2023-02-18 00:04:01,289 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 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:04:04,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:04:04,407 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2023-02-18 00:04:04,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-18 00:04:04,409 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 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:04:04,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:04:04,410 INFO L225 Difference]: With dead ends: 41 [2023-02-18 00:04:04,410 INFO L226 Difference]: Without dead ends: 37 [2023-02-18 00:04:04,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 16 SyntacticMatches, 9 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=895, Invalid=2765, Unknown=0, NotChecked=0, Total=3660 [2023-02-18 00:04:04,412 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 119 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 00:04:04,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 75 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 00:04:04,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-18 00:04:04,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-02-18 00:04:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:04:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2023-02-18 00:04:04,425 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 20 [2023-02-18 00:04:04,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:04:04,425 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2023-02-18 00:04:04,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 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:04:04,430 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2023-02-18 00:04:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 00:04:04,432 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:04:04,432 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1] [2023-02-18 00:04:04,441 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:04:04,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:04:04,639 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:04:04,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:04:04,639 INFO L85 PathProgramCache]: Analyzing trace with hash 685690347, now seen corresponding path program 4 times [2023-02-18 00:04:04,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:04:04,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213648660] [2023-02-18 00:04:04,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:04:04,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:04:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:04:05,680 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:04:05,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:04:05,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213648660] [2023-02-18 00:04:05,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213648660] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:04:05,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354354893] [2023-02-18 00:04:05,681 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 00:04:05,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:04:05,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:04:05,685 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:04:05,688 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:04:05,784 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 00:04:05,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:04:05,814 WARN L261 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 123 conjunts are in the unsatisfiable core [2023-02-18 00:04:05,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:04:06,120 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:04:06,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:04:07,539 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:04:07,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354354893] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:04:07,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:04:07,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2023-02-18 00:04:07,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77022052] [2023-02-18 00:04:07,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:04:07,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-02-18 00:04:07,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:04:07,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-02-18 00:04:07,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=3520, Unknown=0, NotChecked=0, Total=4160 [2023-02-18 00:04:07,544 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 65 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 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:05:25,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 00:05:25,969 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2023-02-18 00:05:25,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-02-18 00:05:25,973 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 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:05:25,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 00:05:25,974 INFO L225 Difference]: With dead ends: 73 [2023-02-18 00:05:25,974 INFO L226 Difference]: Without dead ends: 69 [2023-02-18 00:05:25,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 24 SyntacticMatches, 17 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2117 ImplicationChecksByTransitivity, 74.5s TimeCoverageRelationStatistics Valid=3583, Invalid=11917, Unknown=0, NotChecked=0, Total=15500 [2023-02-18 00:05:25,980 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 512 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-02-18 00:05:25,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 150 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2023-02-18 00:05:25,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-18 00:05:25,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-02-18 00:05:25,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 00:05:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2023-02-18 00:05:25,996 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 36 [2023-02-18 00:05:25,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 00:05:25,997 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2023-02-18 00:05:25,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 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:05:25,997 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2023-02-18 00:05:25,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-18 00:05:25,998 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 00:05:25,999 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1] [2023-02-18 00:05:26,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 00:05:26,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:05:26,204 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-18 00:05:26,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 00:05:26,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1963971595, now seen corresponding path program 5 times [2023-02-18 00:05:26,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 00:05:26,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520174002] [2023-02-18 00:05:26,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 00:05:26,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 00:05:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 00:05:29,311 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:05:29,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 00:05:29,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520174002] [2023-02-18 00:05:29,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520174002] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 00:05:29,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195455620] [2023-02-18 00:05:29,312 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 00:05:29,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 00:05:29,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 00:05:29,313 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:05:29,315 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:06:00,678 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2023-02-18 00:06:00,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 00:06:00,698 WARN L261 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 251 conjunts are in the unsatisfiable core [2023-02-18 00:06:00,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 00:06:01,574 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:06:01,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 00:06:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 00:06:06,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195455620] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 00:06:06,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 00:06:06,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2023-02-18 00:06:06,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519948961] [2023-02-18 00:06:06,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 00:06:06,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 129 states [2023-02-18 00:06:06,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 00:06:06,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2023-02-18 00:06:06,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2304, Invalid=14208, Unknown=0, NotChecked=0, Total=16512 [2023-02-18 00:06:06,459 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand has 129 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 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:06:43,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:06:45,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:06:48,523 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:08:07,665 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:08:09,670 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:08:11,675 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:08:13,695 WARN L837 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ 48 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 6 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 16 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_f_#res#1| 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_f_#res#1| 54) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 60) 4294967296) 268435455) (< (mod (+ 22 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) 268435455) (< (mod (+ 10 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 28 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 56 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ 8 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 30 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 12 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ 52 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 46 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ 32 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_f_#res#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 58) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ 56 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ 36 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ 38 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296) 268435455) (< (mod (+ 26 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_f_#res#1| 50) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ 2 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 58 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 18 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 44 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 14 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 42 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ 4 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 20 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ 34 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455)) is different from false [2023-02-18 00:09:15,422 WARN L837 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ 48 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 6 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 16 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_f_#res#1| 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_f_#res#1| 54) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455) (< (mod (+ 22 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) 268435455) (< (mod (+ 10 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 28 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 56 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ 8 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 30 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 12 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ 52 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 46 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ 32 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_f_#res#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 58) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ 56 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ 36 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ 38 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296) 268435455) (< (mod (+ 26 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_f_#res#1| 50) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ 2 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 18 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 44 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 14 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 42 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ 4 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 20 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ 34 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455)) is different from false [2023-02-18 00:09:58,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:10:01,116 WARN L837 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ 48 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 6 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 16 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_f_#res#1| 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_f_#res#1| 54) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455) (< (mod (+ 22 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) 268435455) (< (mod (+ 10 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 28 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 56 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ 8 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 30 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 12 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ 52 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 46 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ 32 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_f_#res#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ 36 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ 38 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296) 268435455) (< (mod (+ 26 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_f_#res#1| 50) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ 2 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 18 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 44 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 14 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 42 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ 4 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 20 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ 34 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455)) is different from false [2023-02-18 00:10:38,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:10:40,112 WARN L837 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ 48 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 6 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 16 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_f_#res#1| 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455) (< (mod (+ 22 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) 268435455) (< (mod (+ 10 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 28 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 8 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 30 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 12 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ 52 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 46 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ 32 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_f_#res#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ 36 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ 38 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296) 268435455) (< (mod (+ 26 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_f_#res#1| 50) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ 2 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 18 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 44 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 14 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 42 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ 4 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 20 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ 34 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455)) is different from false [2023-02-18 00:12:52,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:12:54,828 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:12:56,833 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:12:58,838 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:13:00,843 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:13:03,663 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:13:06,500 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:13:07,607 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:13:09,619 WARN L837 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ 48 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 6 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 16 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_f_#res#1| 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455) (< (mod (+ 22 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) 268435455) (< (mod (+ 10 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 28 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 8 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 30 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 12 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ 46 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ 32 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_f_#res#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ 36 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ 38 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296) 268435455) (< (mod (+ 26 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_f_#res#1| 50) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ 2 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 18 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 44 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 14 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 42 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ 4 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 20 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ 34 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455)) is different from false [2023-02-18 00:13:40,539 WARN L837 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ 48 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 6 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 16 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_f_#res#1| 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455) (< (mod (+ 22 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) 268435455) (< (mod (+ 10 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 28 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 8 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 30 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 12 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ 46 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ 32 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_f_#res#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ 36 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ 38 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 26 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ 2 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 18 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 44 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 14 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 42 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ 4 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 20 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ 34 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455)) is different from false [2023-02-18 00:15:20,311 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:15:21,469 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:15:22,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:15:24,785 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:15:27,092 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:15:28,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:15:30,365 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:15:33,001 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:15:34,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:15:36,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:15:37,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:15:39,894 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:15:42,609 WARN L837 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ 6 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 16 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_f_#res#1| 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455) (< (mod (+ 22 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296) 268435455) (< (mod (+ 10 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 28 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 8 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 30 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 12 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ 32 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_f_#res#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296) 268435455) (< (mod (+ 36 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ 38 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 26 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ 2 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 18 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 44 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 14 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 42 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ 4 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 20 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ 34 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455)) is different from false [2023-02-18 00:17:12,893 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 [] [2023-02-18 00:17:14,899 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:17:16,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:17:18,372 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:17:20,977 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:17:22,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:17:24,195 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:17:25,786 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:17:27,790 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:17:29,796 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:17:31,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 00:17:34,299 WARN L837 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ 6 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 16 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_f_#res#1| 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455) (< (mod (+ 22 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ 10 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 28 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 8 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 30 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 12 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ 32 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_f_#res#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ 36 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ 38 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 26 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ 2 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 18 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 14 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 42 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ 4 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 20 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ 34 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455)) is different from false [2023-02-18 00:17:59,258 WARN L837 $PredicateComparison]: unable to prove that (and (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296) 268435455) (< (mod (+ 6 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 16 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) 268435455) (< (mod |c_ULTIMATE.start_f_#res#1| 4294967296) 268435455) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 268435455) (< (mod (+ 22 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296) 268435455) (< (mod (+ 10 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 28 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 8 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 30 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 12 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) 268435455) (< (mod (+ 32 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_f_#res#1| 24) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296) 268435455) (< (mod (+ 36 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296) 268435455) (< (mod (+ 38 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 26 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) 268435455) (< (mod (+ 2 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 18 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 14 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296) 268435455) (< (mod (+ 4 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ 20 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) 268435455) (< (mod (+ 34 |c_ULTIMATE.start_f_#res#1|) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296) 268435455) (< (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296) 268435455)) is different from false