/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 09:57:36,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 09:57:36,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 09:57:36,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 09:57:36,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 09:57:36,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 09:57:36,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 09:57:36,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 09:57:36,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 09:57:36,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 09:57:36,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 09:57:36,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 09:57:36,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 09:57:36,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 09:57:36,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 09:57:36,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 09:57:36,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 09:57:36,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 09:57:36,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 09:57:36,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 09:57:36,912 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 09:57:36,913 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 09:57:36,914 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 09:57:36,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 09:57:36,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 09:57:36,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 09:57:36,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 09:57:36,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 09:57:36,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 09:57:36,928 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 09:57:36,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 09:57:36,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 09:57:36,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 09:57:36,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 09:57:36,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 09:57:36,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 09:57:36,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 09:57:36,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 09:57:36,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 09:57:36,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 09:57:36,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 09:57:36,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 09:57:36,937 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-06 09:57:36,955 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 09:57:36,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 09:57:36,956 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-06 09:57:36,956 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-06 09:57:36,957 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-06 09:57:36,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-06 09:57:36,957 INFO L138 SettingsManager]: * Use SBE=true [2022-04-06 09:57:36,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 09:57:36,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 09:57:36,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 09:57:36,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 09:57:36,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 09:57:36,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 09:57:36,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 09:57:36,958 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 09:57:36,958 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 09:57:36,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 09:57:36,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 09:57:36,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 09:57:36,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 09:57:36,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 09:57:36,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-06 09:57:36,959 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-06 09:57:36,959 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-06 09:57:36,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-06 09:57:36,960 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-06 09:57:36,960 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-06 09:57:36,960 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-06 09:57:36,961 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-06 09:57:36,961 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-06 09:57:37,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 09:57:37,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 09:57:37,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 09:57:37,179 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 09:57:37,179 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 09:57:37,180 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-1.c [2022-04-06 09:57:37,243 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/373726f7e/bf9ee4dd0b054662b3bb2379ec561a4a/FLAG17c433f48 [2022-04-06 09:57:37,688 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 09:57:37,688 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-1.c [2022-04-06 09:57:37,694 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/373726f7e/bf9ee4dd0b054662b3bb2379ec561a4a/FLAG17c433f48 [2022-04-06 09:57:37,713 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/373726f7e/bf9ee4dd0b054662b3bb2379ec561a4a [2022-04-06 09:57:37,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 09:57:37,717 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-06 09:57:37,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 09:57:37,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 09:57:37,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 09:57:37,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:57:37" (1/1) ... [2022-04-06 09:57:37,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@344e48a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:57:37, skipping insertion in model container [2022-04-06 09:57:37,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:57:37" (1/1) ... [2022-04-06 09:57:37,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 09:57:37,739 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 09:57:37,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-1.c[313,326] [2022-04-06 09:57:37,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 09:57:37,911 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 09:57:37,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-1.c[313,326] [2022-04-06 09:57:37,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 09:57:37,936 INFO L208 MainTranslator]: Completed translation [2022-04-06 09:57:37,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:57:37 WrapperNode [2022-04-06 09:57:37,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 09:57:37,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 09:57:37,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 09:57:37,940 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 09:57:37,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:57:37" (1/1) ... [2022-04-06 09:57:37,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:57:37" (1/1) ... [2022-04-06 09:57:37,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:57:37" (1/1) ... [2022-04-06 09:57:37,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:57:37" (1/1) ... [2022-04-06 09:57:37,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:57:37" (1/1) ... [2022-04-06 09:57:37,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:57:37" (1/1) ... [2022-04-06 09:57:37,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:57:37" (1/1) ... [2022-04-06 09:57:37,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 09:57:37,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 09:57:37,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 09:57:37,997 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 09:57:37,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:57:37" (1/1) ... [2022-04-06 09:57:38,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 09:57:38,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:57:38,073 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) [2022-04-06 09:57:38,101 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 [2022-04-06 09:57:38,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 09:57:38,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 09:57:38,125 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 09:57:38,125 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-06 09:57:38,125 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 09:57:38,125 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 09:57:38,125 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 09:57:38,125 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 09:57:38,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 09:57:38,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-06 09:57:38,125 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 09:57:38,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 09:57:38,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 09:57:38,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 09:57:38,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 09:57:38,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 09:57:38,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 09:57:38,166 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 09:57:38,168 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 09:57:38,246 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 09:57:38,250 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 09:57:38,251 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-06 09:57:38,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:57:38 BoogieIcfgContainer [2022-04-06 09:57:38,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 09:57:38,253 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-06 09:57:38,253 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-06 09:57:38,254 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-06 09:57:38,256 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:57:38" (1/1) ... [2022-04-06 09:57:38,258 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-06 09:57:38,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 09:57:38 BasicIcfg [2022-04-06 09:57:38,281 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-06 09:57:38,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 09:57:38,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 09:57:38,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 09:57:38,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 09:57:37" (1/4) ... [2022-04-06 09:57:38,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bbe5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:57:38, skipping insertion in model container [2022-04-06 09:57:38,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:57:37" (2/4) ... [2022-04-06 09:57:38,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bbe5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:57:38, skipping insertion in model container [2022-04-06 09:57:38,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:57:38" (3/4) ... [2022-04-06 09:57:38,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bbe5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 09:57:38, skipping insertion in model container [2022-04-06 09:57:38,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 09:57:38" (4/4) ... [2022-04-06 09:57:38,287 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono1_1-1.cqvasr [2022-04-06 09:57:38,290 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-06 09:57:38,291 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-06 09:57:38,321 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 09:57:38,325 INFO L340 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=FINITE_AUTOMATA, 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 [2022-04-06 09:57:38,326 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-06 09:57:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-06 09:57:38,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-06 09:57:38,346 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:57:38,346 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:57:38,347 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:57:38,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:57:38,352 INFO L85 PathProgramCache]: Analyzing trace with hash -756157467, now seen corresponding path program 1 times [2022-04-06 09:57:38,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:57:38,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140532732] [2022-04-06 09:57:38,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:57:38,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:57:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:57:38,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:57:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:57:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:57:38,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:57:38,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140532732] [2022-04-06 09:57:38,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140532732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:57:38,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:57:38,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-06 09:57:38,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202370722] [2022-04-06 09:57:38,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:57:38,525 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-06 09:57:38,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:57:38,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-06 09:57:38,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-06 09:57:38,555 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:57:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:57:38,604 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-06 09:57:38,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-06 09:57:38,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-06 09:57:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:57:38,613 INFO L225 Difference]: With dead ends: 30 [2022-04-06 09:57:38,613 INFO L226 Difference]: Without dead ends: 13 [2022-04-06 09:57:38,615 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-06 09:57:38,619 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 09:57:38,620 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 09:57:38,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-06 09:57:38,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-06 09:57:38,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:57:38,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-06 09:57:38,648 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-06 09:57:38,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:57:38,649 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-06 09:57:38,650 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:57:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-06 09:57:38,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-06 09:57:38,650 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:57:38,651 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:57:38,651 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-06 09:57:38,651 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:57:38,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:57:38,658 INFO L85 PathProgramCache]: Analyzing trace with hash -755233946, now seen corresponding path program 1 times [2022-04-06 09:57:38,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:57:38,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831767097] [2022-04-06 09:57:38,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:57:38,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:57:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:57:38,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:57:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:57:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:57:38,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:57:38,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831767097] [2022-04-06 09:57:38,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831767097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:57:38,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:57:38,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 09:57:38,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363990752] [2022-04-06 09:57:38,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:57:38,777 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 09:57:38,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:57:38,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 09:57:38,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 09:57:38,778 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:57:38,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:57:38,812 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-06 09:57:38,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 09:57:38,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-06 09:57:38,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:57:38,813 INFO L225 Difference]: With dead ends: 22 [2022-04-06 09:57:38,813 INFO L226 Difference]: Without dead ends: 15 [2022-04-06 09:57:38,816 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 09:57:38,817 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 09:57:38,818 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 09:57:38,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-06 09:57:38,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-06 09:57:38,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:57:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-06 09:57:38,822 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-06 09:57:38,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:57:38,822 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-06 09:57:38,822 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:57:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-06 09:57:38,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-06 09:57:38,823 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:57:38,823 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:57:38,823 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-06 09:57:38,823 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:57:38,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:57:38,823 INFO L85 PathProgramCache]: Analyzing trace with hash 980092676, now seen corresponding path program 1 times [2022-04-06 09:57:38,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:57:38,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459816286] [2022-04-06 09:57:38,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:57:38,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:57:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:57:38,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:57:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:57:38,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:57:38,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:57:38,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459816286] [2022-04-06 09:57:38,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459816286] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:57:38,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625030137] [2022-04-06 09:57:38,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:57:38,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:57:38,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:57:38,904 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) [2022-04-06 09:57:38,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-06 09:57:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:57:38,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-06 09:57:38,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:57:39,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:57:39,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:57:39,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:57:39,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625030137] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:57:39,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:57:39,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-06 09:57:39,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492301226] [2022-04-06 09:57:39,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:57:39,064 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-06 09:57:39,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:57:39,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-06 09:57:39,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-06 09:57:39,064 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:57:39,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:57:39,132 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-06 09:57:39,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 09:57:39,132 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-06 09:57:39,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:57:39,133 INFO L225 Difference]: With dead ends: 26 [2022-04-06 09:57:39,133 INFO L226 Difference]: Without dead ends: 19 [2022-04-06 09:57:39,134 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-04-06 09:57:39,134 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 09:57:39,135 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 33 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 09:57:39,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-06 09:57:39,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-06 09:57:39,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:57:39,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-06 09:57:39,138 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-04-06 09:57:39,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:57:39,138 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-06 09:57:39,139 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:57:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-06 09:57:39,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-06 09:57:39,139 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:57:39,139 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:57:39,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-06 09:57:39,370 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:57:39,371 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:57:39,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:57:39,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1575643231, now seen corresponding path program 1 times [2022-04-06 09:57:39,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:57:39,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522636940] [2022-04-06 09:57:39,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:57:39,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:57:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:57:39,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:57:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:57:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:57:39,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:57:39,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522636940] [2022-04-06 09:57:39,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522636940] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:57:39,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504289129] [2022-04-06 09:57:39,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:57:39,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:57:39,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:57:39,508 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) [2022-04-06 09:57:39,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-06 09:57:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:57:39,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-06 09:57:39,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:57:39,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:57:39,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:57:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:57:39,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504289129] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:57:39,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:57:39,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-04-06 09:57:39,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832113198] [2022-04-06 09:57:39,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:57:39,716 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-06 09:57:39,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:57:39,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-06 09:57:39,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-04-06 09:57:39,720 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:57:39,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:57:39,971 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-06 09:57:39,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-06 09:57:39,972 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-06 09:57:39,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:57:39,972 INFO L225 Difference]: With dead ends: 34 [2022-04-06 09:57:39,972 INFO L226 Difference]: Without dead ends: 26 [2022-04-06 09:57:39,972 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2022-04-06 09:57:39,973 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:57:39,973 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 39 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:57:39,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-06 09:57:39,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-06 09:57:39,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:57:39,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-04-06 09:57:39,977 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 17 [2022-04-06 09:57:39,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:57:39,978 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-04-06 09:57:39,978 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:57:39,978 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-06 09:57:39,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-06 09:57:39,978 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:57:39,978 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:57:40,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-06 09:57:40,183 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-06 09:57:40,184 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:57:40,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:57:40,187 INFO L85 PathProgramCache]: Analyzing trace with hash 109985751, now seen corresponding path program 2 times [2022-04-06 09:57:40,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:57:40,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133507773] [2022-04-06 09:57:40,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:57:40,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:57:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:57:40,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:57:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:57:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:57:40,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:57:40,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133507773] [2022-04-06 09:57:40,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133507773] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:57:40,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658199949] [2022-04-06 09:57:40,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 09:57:40,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:57:40,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:57:40,342 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) [2022-04-06 09:57:40,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-06 09:57:40,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 09:57:40,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 09:57:40,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-06 09:57:40,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:57:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:57:40,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:57:40,789 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:57:40,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658199949] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:57:40,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:57:40,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 23 [2022-04-06 09:57:40,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086059521] [2022-04-06 09:57:40,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:57:40,790 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-06 09:57:40,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:57:40,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-06 09:57:40,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-04-06 09:57:40,792 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:57:42,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:57:42,026 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-06 09:57:42,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-06 09:57:42,026 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-06 09:57:42,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:57:42,028 INFO L225 Difference]: With dead ends: 47 [2022-04-06 09:57:42,028 INFO L226 Difference]: Without dead ends: 36 [2022-04-06 09:57:42,028 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=311, Invalid=1095, Unknown=0, NotChecked=0, Total=1406 [2022-04-06 09:57:42,029 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 09:57:42,029 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 71 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 09:57:42,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-06 09:57:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-06 09:57:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:57:42,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-04-06 09:57:42,034 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 25 [2022-04-06 09:57:42,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:57:42,034 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-04-06 09:57:42,034 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:57:42,034 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-06 09:57:42,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-06 09:57:42,037 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:57:42,037 INFO L499 BasicCegarLoop]: trace histogram [12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:57:42,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-06 09:57:42,256 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:57:42,256 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:57:42,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:57:42,257 INFO L85 PathProgramCache]: Analyzing trace with hash 134643049, now seen corresponding path program 3 times [2022-04-06 09:57:42,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:57:42,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059804500] [2022-04-06 09:57:42,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:57:42,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:57:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:57:42,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:57:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:57:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-06 09:57:42,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:57:42,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059804500] [2022-04-06 09:57:42,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059804500] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:57:42,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497607160] [2022-04-06 09:57:42,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-06 09:57:42,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:57:42,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:57:42,449 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) [2022-04-06 09:57:42,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-06 09:57:42,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-04-06 09:57:42,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 09:57:42,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-06 09:57:42,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:57:42,762 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 77 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-06 09:57:42,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:57:43,494 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 77 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-06 09:57:43,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497607160] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:57:43,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:57:43,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 12] total 27 [2022-04-06 09:57:43,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362860545] [2022-04-06 09:57:43,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:57:43,496 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-06 09:57:43,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:57:43,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-06 09:57:43,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2022-04-06 09:57:43,498 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:57:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:57:50,144 INFO L93 Difference]: Finished difference Result 73 states and 99 transitions. [2022-04-06 09:57:50,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-06 09:57:50,144 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-06 09:57:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:57:50,145 INFO L225 Difference]: With dead ends: 73 [2022-04-06 09:57:50,145 INFO L226 Difference]: Without dead ends: 54 [2022-04-06 09:57:50,147 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=699, Invalid=2381, Unknown=0, NotChecked=0, Total=3080 [2022-04-06 09:57:50,147 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 87 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:57:50,148 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 51 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-06 09:57:50,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-06 09:57:50,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-04-06 09:57:50,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:57:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-06 09:57:50,154 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 35 [2022-04-06 09:57:50,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:57:50,154 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-06 09:57:50,154 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:57:50,154 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-06 09:57:50,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-06 09:57:50,155 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:57:50,155 INFO L499 BasicCegarLoop]: trace histogram [20, 12, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:57:50,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-06 09:57:50,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:57:50,355 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:57:50,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:57:50,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1228107086, now seen corresponding path program 4 times [2022-04-06 09:57:50,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:57:50,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626897415] [2022-04-06 09:57:50,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:57:50,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:57:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:57:50,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:57:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:57:50,480 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-06 09:57:50,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:57:50,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626897415] [2022-04-06 09:57:50,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626897415] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:57:50,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717083627] [2022-04-06 09:57:50,480 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-06 09:57:50,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:57:50,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:57:50,483 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) [2022-04-06 09:57:50,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-06 09:57:50,542 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-06 09:57:50,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 09:57:50,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-06 09:57:50,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:57:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-06 09:57:50,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:57:51,429 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-06 09:57:51,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717083627] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:57:51,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:57:51,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 19] total 37 [2022-04-06 09:57:51,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911461548] [2022-04-06 09:57:51,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:57:51,430 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-06 09:57:51,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:57:51,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-06 09:57:51,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=962, Unknown=0, NotChecked=0, Total=1332 [2022-04-06 09:57:51,431 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:58:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:58:20,542 INFO L93 Difference]: Finished difference Result 116 states and 147 transitions. [2022-04-06 09:58:20,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-06 09:58:20,543 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-06 09:58:20,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:58:20,543 INFO L225 Difference]: With dead ends: 116 [2022-04-06 09:58:20,543 INFO L226 Difference]: Without dead ends: 86 [2022-04-06 09:58:20,544 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=1061, Invalid=2845, Unknown=0, NotChecked=0, Total=3906 [2022-04-06 09:58:20,545 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-06 09:58:20,545 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 99 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-06 09:58:20,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-06 09:58:20,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-06 09:58:20,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:58:20,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-04-06 09:58:20,557 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 51 [2022-04-06 09:58:20,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:58:20,557 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-04-06 09:58:20,557 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:58:20,557 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-04-06 09:58:20,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-06 09:58:20,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:58:20,558 INFO L499 BasicCegarLoop]: trace histogram [37, 25, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:58:20,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-06 09:58:20,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:58:20,759 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:58:20,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:58:20,760 INFO L85 PathProgramCache]: Analyzing trace with hash 525547056, now seen corresponding path program 5 times [2022-04-06 09:58:20,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:58:20,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277754033] [2022-04-06 09:58:20,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:58:20,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:58:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:58:21,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:58:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:58:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 598 proven. 650 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-06 09:58:21,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:58:21,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277754033] [2022-04-06 09:58:21,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277754033] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:58:21,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873904816] [2022-04-06 09:58:21,280 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-06 09:58:21,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:58:21,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:58:21,281 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 09:58:21,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-06 09:58:29,887 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2022-04-06 09:58:29,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 09:58:29,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-06 09:58:29,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:58:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 493 proven. 812 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-06 09:58:30,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:58:32,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 493 proven. 812 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-06 09:58:32,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873904816] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:58:32,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:58:32,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31, 32] total 63 [2022-04-06 09:58:32,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68138772] [2022-04-06 09:58:32,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:58:32,126 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-06 09:58:32,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:58:32,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-06 09:58:32,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1050, Invalid=2856, Unknown=0, NotChecked=0, Total=3906 [2022-04-06 09:58:32,128 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:59:06,405 WARN L232 SmtUtils]: Spent 14.38s on a formula simplification. DAG size of input: 209 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-06 09:59:34,290 WARN L232 SmtUtils]: Spent 6.55s on a formula simplification. DAG size of input: 202 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-06 10:00:06,910 WARN L232 SmtUtils]: Spent 14.45s on a formula simplification. DAG size of input: 195 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-06 10:00:36,804 WARN L232 SmtUtils]: Spent 8.63s on a formula simplification. DAG size of input: 188 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-06 10:01:54,194 WARN L232 SmtUtils]: Spent 8.73s on a formula simplification. DAG size of input: 167 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-06 10:05:36,115 WARN L232 SmtUtils]: Spent 23.22s on a formula simplification. DAG size of input: 212 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-06 10:05:36,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:05:36,166 INFO L93 Difference]: Finished difference Result 176 states and 220 transitions. [2022-04-06 10:05:36,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-06 10:05:36,166 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-06 10:05:36,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:05:36,167 INFO L225 Difference]: With dead ends: 176 [2022-04-06 10:05:36,168 INFO L226 Difference]: Without dead ends: 146 [2022-04-06 10:05:36,170 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 424.9s TimeCoverageRelationStatistics Valid=3726, Invalid=10310, Unknown=6, NotChecked=0, Total=14042 [2022-04-06 10:05:36,171 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 118 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-06 10:05:36,171 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 159 Invalid, 2067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-06 10:05:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-06 10:05:36,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-06 10:05:36,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.0567375886524824) internal successors, (149), 141 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 10:05:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 153 transitions. [2022-04-06 10:05:36,185 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 153 transitions. Word has length 85 [2022-04-06 10:05:36,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:05:36,186 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 153 transitions. [2022-04-06 10:05:36,186 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.0634920634920637) internal successors, (130), 62 states have internal predecessors, (130), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 10:05:36,186 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 153 transitions. [2022-04-06 10:05:36,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-06 10:05:36,187 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:05:36,187 INFO L499 BasicCegarLoop]: trace histogram [67, 55, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 10:05:36,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-06 10:05:36,392 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 10:05:36,393 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:05:36,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:05:36,393 INFO L85 PathProgramCache]: Analyzing trace with hash 729081652, now seen corresponding path program 6 times [2022-04-06 10:05:36,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:05:36,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223533864] [2022-04-06 10:05:36,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:05:36,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:05:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:05:37,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:05:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:05:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1288 proven. 3080 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-06 10:05:37,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:05:37,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223533864] [2022-04-06 10:05:37,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223533864] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 10:05:37,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413914813] [2022-04-06 10:05:37,896 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-06 10:05:37,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 10:05:37,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 10:05:37,897 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 10:05:37,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-06 10:05:56,058 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2022-04-06 10:05:56,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 10:05:56,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-06 10:05:56,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 10:05:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1375 proven. 144 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2022-04-06 10:05:57,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 10:06:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1375 proven. 144 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2022-04-06 10:06:00,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413914813] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 10:06:00,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 10:06:00,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 15, 19] total 89 [2022-04-06 10:06:00,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851818185] [2022-04-06 10:06:00,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 10:06:00,865 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-04-06 10:06:00,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:06:00,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-04-06 10:06:00,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1264, Invalid=6568, Unknown=0, NotChecked=0, Total=7832 [2022-04-06 10:06:00,867 INFO L87 Difference]: Start difference. First operand 146 states and 153 transitions. Second operand has 89 states, 88 states have (on average 2.034090909090909) internal successors, (179), 87 states have internal predecessors, (179), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 10:06:43,021 WARN L232 SmtUtils]: Spent 17.84s on a formula simplification. DAG size of input: 98 DAG size of output: 96 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-06 10:07:01,083 WARN L232 SmtUtils]: Spent 6.63s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-06 10:07:25,561 WARN L232 SmtUtils]: Spent 12.28s on a formula simplification. DAG size of input: 91 DAG size of output: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-06 10:07:56,558 WARN L232 SmtUtils]: Spent 7.61s on a formula simplification. DAG size of input: 84 DAG size of output: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-06 10:08:19,989 WARN L232 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 77 DAG size of output: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-06 10:09:27,123 WARN L232 SmtUtils]: Spent 11.10s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-06 10:09:27,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:09:27,201 INFO L93 Difference]: Finished difference Result 209 states and 252 transitions. [2022-04-06 10:09:27,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-04-06 10:09:27,201 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 88 states have (on average 2.034090909090909) internal successors, (179), 87 states have internal predecessors, (179), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-06 10:09:27,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:09:27,202 INFO L225 Difference]: With dead ends: 209 [2022-04-06 10:09:27,202 INFO L226 Difference]: Without dead ends: 176 [2022-04-06 10:09:27,207 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 275 SyntacticMatches, 2 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4767 ImplicationChecksByTransitivity, 196.3s TimeCoverageRelationStatistics Valid=4977, Invalid=29431, Unknown=2, NotChecked=0, Total=34410 [2022-04-06 10:09:27,207 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 342 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 8260 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 8731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 8260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-04-06 10:09:27,208 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 106 Invalid, 8731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 8260 Invalid, 0 Unknown, 0 Unchecked, 15.1s Time] [2022-04-06 10:09:27,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-04-06 10:09:27,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2022-04-06 10:09:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 171 states have (on average 1.087719298245614) internal successors, (186), 171 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 10:09:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 190 transitions. [2022-04-06 10:09:27,225 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 190 transitions. Word has length 145 [2022-04-06 10:09:27,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:09:27,226 INFO L478 AbstractCegarLoop]: Abstraction has 176 states and 190 transitions. [2022-04-06 10:09:27,226 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 88 states have (on average 2.034090909090909) internal successors, (179), 87 states have internal predecessors, (179), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 10:09:27,226 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 190 transitions. [2022-04-06 10:09:27,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-06 10:09:27,227 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:09:27,227 INFO L499 BasicCegarLoop]: trace histogram [82, 56, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 10:09:27,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-06 10:09:27,434 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 10:09:27,434 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:09:27,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:09:27,435 INFO L85 PathProgramCache]: Analyzing trace with hash -2146523672, now seen corresponding path program 7 times [2022-04-06 10:09:27,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:09:27,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073217903] [2022-04-06 10:09:27,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:09:27,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:09:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:09:29,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:09:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:09:29,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 2907 proven. 3192 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2022-04-06 10:09:29,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:09:29,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073217903] [2022-04-06 10:09:29,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073217903] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 10:09:29,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413783659] [2022-04-06 10:09:29,082 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-06 10:09:29,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 10:09:29,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 10:09:29,083 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 10:09:29,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-06 10:09:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:09:29,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 156 conjunts are in the unsatisfiable core [2022-04-06 10:09:29,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 10:09:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 847 proven. 5852 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-06 10:09:30,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 10:09:42,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 847 proven. 5852 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-06 10:09:42,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413783659] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 10:09:42,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 10:09:42,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 79, 80] total 159 [2022-04-06 10:09:42,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741358222] [2022-04-06 10:09:42,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 10:09:42,172 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 159 states [2022-04-06 10:09:42,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:09:42,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2022-04-06 10:09:42,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6457, Invalid=18665, Unknown=0, NotChecked=0, Total=25122 [2022-04-06 10:09:42,175 INFO L87 Difference]: Start difference. First operand 176 states and 190 transitions. Second operand has 159 states, 159 states have (on average 2.0251572327044025) internal successors, (322), 158 states have internal predecessors, (322), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 10:09:48,710 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ c_main_~x~0 79) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ 94 c_main_~x~0) 4294967296))) (or (not (< .cse1 100000000)) (< .cse1 10000000))) (let ((.cse2 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse2 10000000) (not (< .cse2 100000000)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse3 (mod (+ c_main_~x~0 93) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse7 100000000)) (< .cse7 10000000))) (let ((.cse8 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse9 100000000)) (< .cse9 10000000))) (let ((.cse10 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ 78 c_main_~x~0) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ 57 c_main_~x~0) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ 90 c_main_~x~0) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ 88 c_main_~x~0) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ c_main_~x~0 80) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ c_main_~x~0 54) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ 84 c_main_~x~0) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ c_main_~x~0 86) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ 82 c_main_~x~0) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ 52 c_main_~x~0) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000)))) (let ((.cse30 (mod (+ 67 c_main_~x~0) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse31 10000000) (not (< .cse31 100000000)))) (let ((.cse32 (mod (+ 64 c_main_~x~0) 4294967296))) (or (< .cse32 10000000) (not (< .cse32 100000000)))) (let ((.cse33 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse33 10000000) (not (< .cse33 100000000)))) (let ((.cse34 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse34 10000000) (not (< .cse34 100000000)))) (let ((.cse35 (mod (+ 76 c_main_~x~0) 4294967296))) (or (< .cse35 10000000) (not (< .cse35 100000000)))) (let ((.cse36 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse36 100000000)) (< .cse36 10000000))) (let ((.cse37 (mod (+ 87 c_main_~x~0) 4294967296))) (or (not (< .cse37 100000000)) (< .cse37 10000000))) (let ((.cse38 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< .cse38 10000000) (not (< .cse38 100000000)))) (let ((.cse39 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse39 100000000)) (< .cse39 10000000))) (let ((.cse40 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse40 10000000) (not (< .cse40 100000000)))) (let ((.cse41 (mod (+ 53 c_main_~x~0) 4294967296))) (or (not (< .cse41 100000000)) (< .cse41 10000000))) (let ((.cse42 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse42 100000000)) (< .cse42 10000000))) (let ((.cse43 (mod (+ c_main_~x~0 83) 4294967296))) (or (< .cse43 10000000) (not (< .cse43 100000000)))) (let ((.cse44 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse44 10000000) (not (< .cse44 100000000)))) (let ((.cse45 (mod (+ 92 c_main_~x~0) 4294967296))) (or (not (< .cse45 100000000)) (< .cse45 10000000))) (let ((.cse46 (mod (+ 89 c_main_~x~0) 4294967296))) (or (< .cse46 10000000) (not (< .cse46 100000000)))) (let ((.cse47 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse47 100000000)) (< .cse47 10000000))) (let ((.cse48 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse48 100000000)) (< .cse48 10000000))) (let ((.cse49 (mod (+ 65 c_main_~x~0) 4294967296))) (or (not (< .cse49 100000000)) (< .cse49 10000000))) (let ((.cse50 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse50 100000000)) (< .cse50 10000000))) (let ((.cse51 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse51 100000000)) (< .cse51 10000000))) (let ((.cse52 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (< .cse52 100000000)) (< .cse52 10000000))) (let ((.cse53 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse53 100000000)) (< .cse53 10000000))) (let ((.cse54 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse54 10000000) (not (< .cse54 100000000)))) (let ((.cse55 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse55 10000000) (not (< .cse55 100000000)))) (let ((.cse56 (mod (+ 81 c_main_~x~0) 4294967296))) (or (< .cse56 10000000) (not (< .cse56 100000000)))) (let ((.cse57 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse57 10000000) (not (< .cse57 100000000)))) (let ((.cse58 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse58 10000000) (not (< .cse58 100000000)))) (let ((.cse59 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse59 10000000) (not (< .cse59 100000000)))) (let ((.cse60 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse60 100000000)) (< .cse60 10000000))) (let ((.cse61 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (< .cse61 100000000)) (< .cse61 10000000))) (let ((.cse62 (mod (+ 73 c_main_~x~0) 4294967296))) (or (not (< .cse62 100000000)) (< .cse62 10000000))) (let ((.cse63 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse63 10000000) (not (< .cse63 100000000)))) (let ((.cse64 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse64 10000000) (not (< .cse64 100000000)))) (let ((.cse65 (mod (+ 85 c_main_~x~0) 4294967296))) (or (< .cse65 10000000) (not (< .cse65 100000000)))) (let ((.cse66 (mod (+ 77 c_main_~x~0) 4294967296))) (or (not (< .cse66 100000000)) (< .cse66 10000000))) (let ((.cse67 (mod (+ 95 c_main_~x~0) 4294967296))) (or (< .cse67 10000000) (not (< .cse67 100000000)))) (let ((.cse68 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse68 100000000)) (< .cse68 10000000))) (let ((.cse69 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse69 10000000) (not (< .cse69 100000000)))) (let ((.cse70 (mod (+ c_main_~x~0 96) 4294967296))) (or (not (< .cse70 100000000)) (< .cse70 10000000))) (let ((.cse71 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse71 100000000)) (< .cse71 10000000))) (let ((.cse72 (mod (+ 51 c_main_~x~0) 4294967296))) (or (not (< .cse72 100000000)) (< .cse72 10000000))) (let ((.cse73 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse73 100000000)) (< .cse73 10000000))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse74 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse74 10000000) (not (< .cse74 100000000)))) (let ((.cse75 (mod (+ 91 c_main_~x~0) 4294967296))) (or (< .cse75 10000000) (not (< .cse75 100000000))))) is different from false [2022-04-06 10:09:50,731 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ c_main_~x~0 79) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ 94 c_main_~x~0) 4294967296))) (or (not (< .cse1 100000000)) (< .cse1 10000000))) (let ((.cse2 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse2 10000000) (not (< .cse2 100000000)))) (let ((.cse3 (mod (+ c_main_~x~0 93) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (< .cse7 100000000)) (< .cse7 10000000))) (let ((.cse8 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 22 c_main_~x~0) 4294967296))) (or (not (< .cse9 100000000)) (< .cse9 10000000))) (let ((.cse10 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ 78 c_main_~x~0) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ 57 c_main_~x~0) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ 90 c_main_~x~0) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ 88 c_main_~x~0) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ c_main_~x~0 80) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ c_main_~x~0 54) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ 84 c_main_~x~0) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ c_main_~x~0 86) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ 82 c_main_~x~0) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ 52 c_main_~x~0) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000)))) (let ((.cse30 (mod (+ 67 c_main_~x~0) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse31 10000000) (not (< .cse31 100000000)))) (let ((.cse32 (mod (+ 64 c_main_~x~0) 4294967296))) (or (< .cse32 10000000) (not (< .cse32 100000000)))) (let ((.cse33 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse33 10000000) (not (< .cse33 100000000)))) (let ((.cse34 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse34 10000000) (not (< .cse34 100000000)))) (let ((.cse35 (mod (+ 76 c_main_~x~0) 4294967296))) (or (< .cse35 10000000) (not (< .cse35 100000000)))) (let ((.cse36 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse36 100000000)) (< .cse36 10000000))) (let ((.cse37 (mod (+ 87 c_main_~x~0) 4294967296))) (or (not (< .cse37 100000000)) (< .cse37 10000000))) (let ((.cse38 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< .cse38 10000000) (not (< .cse38 100000000)))) (let ((.cse39 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse39 100000000)) (< .cse39 10000000))) (let ((.cse40 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse40 10000000) (not (< .cse40 100000000)))) (let ((.cse41 (mod (+ 53 c_main_~x~0) 4294967296))) (or (not (< .cse41 100000000)) (< .cse41 10000000))) (let ((.cse42 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse42 100000000)) (< .cse42 10000000))) (let ((.cse43 (mod (+ c_main_~x~0 83) 4294967296))) (or (< .cse43 10000000) (not (< .cse43 100000000)))) (let ((.cse44 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< .cse44 10000000) (not (< .cse44 100000000)))) (let ((.cse45 (mod (+ 92 c_main_~x~0) 4294967296))) (or (not (< .cse45 100000000)) (< .cse45 10000000))) (let ((.cse46 (mod (+ 89 c_main_~x~0) 4294967296))) (or (< .cse46 10000000) (not (< .cse46 100000000)))) (let ((.cse47 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse47 100000000)) (< .cse47 10000000))) (let ((.cse48 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse48 100000000)) (< .cse48 10000000))) (let ((.cse49 (mod (+ 65 c_main_~x~0) 4294967296))) (or (not (< .cse49 100000000)) (< .cse49 10000000))) (let ((.cse50 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse50 100000000)) (< .cse50 10000000))) (let ((.cse51 (mod (+ 14 c_main_~x~0) 4294967296))) (or (not (< .cse51 100000000)) (< .cse51 10000000))) (let ((.cse52 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (< .cse52 100000000)) (< .cse52 10000000))) (let ((.cse53 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse53 100000000)) (< .cse53 10000000))) (let ((.cse54 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse54 10000000) (not (< .cse54 100000000)))) (let ((.cse55 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse55 10000000) (not (< .cse55 100000000)))) (let ((.cse56 (mod (+ 81 c_main_~x~0) 4294967296))) (or (< .cse56 10000000) (not (< .cse56 100000000)))) (let ((.cse57 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse57 10000000) (not (< .cse57 100000000)))) (let ((.cse58 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse58 10000000) (not (< .cse58 100000000)))) (let ((.cse59 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse59 10000000) (not (< .cse59 100000000)))) (let ((.cse60 (mod (+ 26 c_main_~x~0) 4294967296))) (or (not (< .cse60 100000000)) (< .cse60 10000000))) (let ((.cse61 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (< .cse61 100000000)) (< .cse61 10000000))) (let ((.cse62 (mod (+ 73 c_main_~x~0) 4294967296))) (or (not (< .cse62 100000000)) (< .cse62 10000000))) (let ((.cse63 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse63 10000000) (not (< .cse63 100000000)))) (let ((.cse64 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< .cse64 10000000) (not (< .cse64 100000000)))) (let ((.cse65 (mod (+ 85 c_main_~x~0) 4294967296))) (or (< .cse65 10000000) (not (< .cse65 100000000)))) (let ((.cse66 (mod (+ 77 c_main_~x~0) 4294967296))) (or (not (< .cse66 100000000)) (< .cse66 10000000))) (let ((.cse67 (mod (+ 95 c_main_~x~0) 4294967296))) (or (< .cse67 10000000) (not (< .cse67 100000000)))) (let ((.cse68 (mod (+ 20 c_main_~x~0) 4294967296))) (or (not (< .cse68 100000000)) (< .cse68 10000000))) (let ((.cse69 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< .cse69 10000000) (not (< .cse69 100000000)))) (let ((.cse70 (mod (+ c_main_~x~0 96) 4294967296))) (or (not (< .cse70 100000000)) (< .cse70 10000000))) (let ((.cse71 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse71 100000000)) (< .cse71 10000000))) (let ((.cse72 (mod (+ 51 c_main_~x~0) 4294967296))) (or (not (< .cse72 100000000)) (< .cse72 10000000))) (let ((.cse73 (mod (+ c_main_~x~0 24) 4294967296))) (or (not (< .cse73 100000000)) (< .cse73 10000000))) (< (mod c_main_~x~0 4294967296) 10000000) (let ((.cse74 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse74 10000000) (not (< .cse74 100000000)))) (let ((.cse75 (mod (+ 91 c_main_~x~0) 4294967296))) (or (< .cse75 10000000) (not (< .cse75 100000000))))) is different from false [2022-04-06 10:09:52,748 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ c_main_~x~0 79) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ 94 c_main_~x~0) 4294967296))) (or (not (< .cse1 100000000)) (< .cse1 10000000))) (let ((.cse2 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse2 10000000) (not (< .cse2 100000000)))) (let ((.cse3 (mod (+ c_main_~x~0 93) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ 78 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 57 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 90 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 88 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ c_main_~x~0 80) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ c_main_~x~0 54) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ 84 c_main_~x~0) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ c_main_~x~0 86) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ 82 c_main_~x~0) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000)))) (let ((.cse24 (mod (+ 52 c_main_~x~0) 4294967296))) (or (< .cse24 10000000) (not (< .cse24 100000000)))) (let ((.cse25 (mod (+ 67 c_main_~x~0) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ 64 c_main_~x~0) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse27 10000000) (not (< .cse27 100000000)))) (let ((.cse28 (mod (+ 76 c_main_~x~0) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse29 100000000)) (< .cse29 10000000))) (let ((.cse30 (mod (+ 87 c_main_~x~0) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< .cse31 10000000) (not (< .cse31 100000000)))) (let ((.cse32 (mod (+ 53 c_main_~x~0) 4294967296))) (or (not (< .cse32 100000000)) (< .cse32 10000000))) (let ((.cse33 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse33 100000000)) (< .cse33 10000000))) (let ((.cse34 (mod (+ c_main_~x~0 83) 4294967296))) (or (< .cse34 10000000) (not (< .cse34 100000000)))) (let ((.cse35 (mod (+ 92 c_main_~x~0) 4294967296))) (or (not (< .cse35 100000000)) (< .cse35 10000000))) (let ((.cse36 (mod (+ 89 c_main_~x~0) 4294967296))) (or (< .cse36 10000000) (not (< .cse36 100000000)))) (let ((.cse37 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse37 100000000)) (< .cse37 10000000))) (let ((.cse38 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse38 100000000)) (< .cse38 10000000))) (let ((.cse39 (mod (+ 65 c_main_~x~0) 4294967296))) (or (not (< .cse39 100000000)) (< .cse39 10000000))) (let ((.cse40 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse40 100000000)) (< .cse40 10000000))) (let ((.cse41 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (< .cse41 100000000)) (< .cse41 10000000))) (let ((.cse42 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse42 100000000)) (< .cse42 10000000))) (let ((.cse43 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse43 10000000) (not (< .cse43 100000000)))) (let ((.cse44 (mod (+ 81 c_main_~x~0) 4294967296))) (or (< .cse44 10000000) (not (< .cse44 100000000)))) (let ((.cse45 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse45 10000000) (not (< .cse45 100000000)))) (let ((.cse46 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse46 10000000) (not (< .cse46 100000000)))) (let ((.cse47 (mod (+ 73 c_main_~x~0) 4294967296))) (or (not (< .cse47 100000000)) (< .cse47 10000000))) (let ((.cse48 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse48 10000000) (not (< .cse48 100000000)))) (let ((.cse49 (mod (+ 85 c_main_~x~0) 4294967296))) (or (< .cse49 10000000) (not (< .cse49 100000000)))) (let ((.cse50 (mod (+ 77 c_main_~x~0) 4294967296))) (or (not (< .cse50 100000000)) (< .cse50 10000000))) (let ((.cse51 (mod (+ 95 c_main_~x~0) 4294967296))) (or (< .cse51 10000000) (not (< .cse51 100000000)))) (let ((.cse52 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse52 100000000)) (< .cse52 10000000))) (let ((.cse53 (mod (+ 51 c_main_~x~0) 4294967296))) (or (not (< .cse53 100000000)) (< .cse53 10000000))) (let ((.cse54 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse54 10000000) (not (< .cse54 100000000)))) (let ((.cse55 (mod (+ 91 c_main_~x~0) 4294967296))) (or (< .cse55 10000000) (not (< .cse55 100000000))))) is different from false [2022-04-06 10:09:54,766 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ c_main_~x~0 79) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ 94 c_main_~x~0) 4294967296))) (or (not (< .cse1 100000000)) (< .cse1 10000000))) (let ((.cse2 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse2 10000000) (not (< .cse2 100000000)))) (let ((.cse3 (mod (+ c_main_~x~0 93) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ 78 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 57 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 90 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 88 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ c_main_~x~0 80) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ c_main_~x~0 54) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ 84 c_main_~x~0) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ c_main_~x~0 86) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ 82 c_main_~x~0) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000)))) (let ((.cse24 (mod (+ 52 c_main_~x~0) 4294967296))) (or (< .cse24 10000000) (not (< .cse24 100000000)))) (let ((.cse25 (mod (+ 67 c_main_~x~0) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ 64 c_main_~x~0) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse27 10000000) (not (< .cse27 100000000)))) (let ((.cse28 (mod (+ 76 c_main_~x~0) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse29 100000000)) (< .cse29 10000000))) (let ((.cse30 (mod (+ 87 c_main_~x~0) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< .cse31 10000000) (not (< .cse31 100000000)))) (let ((.cse32 (mod (+ 53 c_main_~x~0) 4294967296))) (or (not (< .cse32 100000000)) (< .cse32 10000000))) (let ((.cse33 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse33 100000000)) (< .cse33 10000000))) (let ((.cse34 (mod (+ c_main_~x~0 83) 4294967296))) (or (< .cse34 10000000) (not (< .cse34 100000000)))) (let ((.cse35 (mod (+ 92 c_main_~x~0) 4294967296))) (or (not (< .cse35 100000000)) (< .cse35 10000000))) (let ((.cse36 (mod (+ 89 c_main_~x~0) 4294967296))) (or (< .cse36 10000000) (not (< .cse36 100000000)))) (let ((.cse37 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse37 100000000)) (< .cse37 10000000))) (let ((.cse38 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse38 100000000)) (< .cse38 10000000))) (let ((.cse39 (mod (+ 65 c_main_~x~0) 4294967296))) (or (not (< .cse39 100000000)) (< .cse39 10000000))) (let ((.cse40 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse40 100000000)) (< .cse40 10000000))) (let ((.cse41 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (< .cse41 100000000)) (< .cse41 10000000))) (let ((.cse42 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse42 100000000)) (< .cse42 10000000))) (let ((.cse43 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse43 10000000) (not (< .cse43 100000000)))) (let ((.cse44 (mod (+ 81 c_main_~x~0) 4294967296))) (or (< .cse44 10000000) (not (< .cse44 100000000)))) (let ((.cse45 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse45 10000000) (not (< .cse45 100000000)))) (let ((.cse46 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse46 10000000) (not (< .cse46 100000000)))) (let ((.cse47 (mod (+ 73 c_main_~x~0) 4294967296))) (or (not (< .cse47 100000000)) (< .cse47 10000000))) (let ((.cse48 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse48 10000000) (not (< .cse48 100000000)))) (let ((.cse49 (mod (+ 85 c_main_~x~0) 4294967296))) (or (< .cse49 10000000) (not (< .cse49 100000000)))) (let ((.cse50 (mod (+ 77 c_main_~x~0) 4294967296))) (or (not (< .cse50 100000000)) (< .cse50 10000000))) (let ((.cse51 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse51 100000000)) (< .cse51 10000000))) (let ((.cse52 (mod (+ 51 c_main_~x~0) 4294967296))) (or (not (< .cse52 100000000)) (< .cse52 10000000))) (let ((.cse53 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse53 10000000) (not (< .cse53 100000000)))) (let ((.cse54 (mod (+ 91 c_main_~x~0) 4294967296))) (or (< .cse54 10000000) (not (< .cse54 100000000))))) is different from false [2022-04-06 10:09:57,047 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ c_main_~x~0 79) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ c_main_~x~0 93) 4294967296))) (or (< .cse2 10000000) (not (< .cse2 100000000)))) (let ((.cse3 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 78 c_main_~x~0) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 57 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 90 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 88 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse10 100000000)) (< .cse10 10000000))) (let ((.cse11 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ c_main_~x~0 80) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ c_main_~x~0 54) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (let ((.cse17 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ 84 c_main_~x~0) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ c_main_~x~0 86) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ 82 c_main_~x~0) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ 52 c_main_~x~0) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000)))) (let ((.cse24 (mod (+ 67 c_main_~x~0) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ 64 c_main_~x~0) 4294967296))) (or (< .cse25 10000000) (not (< .cse25 100000000)))) (let ((.cse26 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ 76 c_main_~x~0) 4294967296))) (or (< .cse27 10000000) (not (< .cse27 100000000)))) (let ((.cse28 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse28 100000000)) (< .cse28 10000000))) (let ((.cse29 (mod (+ 87 c_main_~x~0) 4294967296))) (or (not (< .cse29 100000000)) (< .cse29 10000000))) (let ((.cse30 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< .cse30 10000000) (not (< .cse30 100000000)))) (let ((.cse31 (mod (+ 53 c_main_~x~0) 4294967296))) (or (not (< .cse31 100000000)) (< .cse31 10000000))) (let ((.cse32 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse32 100000000)) (< .cse32 10000000))) (let ((.cse33 (mod (+ c_main_~x~0 83) 4294967296))) (or (< .cse33 10000000) (not (< .cse33 100000000)))) (let ((.cse34 (mod (+ 92 c_main_~x~0) 4294967296))) (or (not (< .cse34 100000000)) (< .cse34 10000000))) (let ((.cse35 (mod (+ 89 c_main_~x~0) 4294967296))) (or (< .cse35 10000000) (not (< .cse35 100000000)))) (let ((.cse36 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse36 100000000)) (< .cse36 10000000))) (let ((.cse37 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse37 100000000)) (< .cse37 10000000))) (let ((.cse38 (mod (+ 65 c_main_~x~0) 4294967296))) (or (not (< .cse38 100000000)) (< .cse38 10000000))) (let ((.cse39 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse39 100000000)) (< .cse39 10000000))) (let ((.cse40 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (< .cse40 100000000)) (< .cse40 10000000))) (let ((.cse41 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse41 100000000)) (< .cse41 10000000))) (let ((.cse42 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse42 10000000) (not (< .cse42 100000000)))) (let ((.cse43 (mod (+ 81 c_main_~x~0) 4294967296))) (or (< .cse43 10000000) (not (< .cse43 100000000)))) (let ((.cse44 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse44 10000000) (not (< .cse44 100000000)))) (let ((.cse45 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse45 10000000) (not (< .cse45 100000000)))) (let ((.cse46 (mod (+ 73 c_main_~x~0) 4294967296))) (or (not (< .cse46 100000000)) (< .cse46 10000000))) (let ((.cse47 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse47 10000000) (not (< .cse47 100000000)))) (let ((.cse48 (mod (+ 85 c_main_~x~0) 4294967296))) (or (< .cse48 10000000) (not (< .cse48 100000000)))) (let ((.cse49 (mod (+ 77 c_main_~x~0) 4294967296))) (or (not (< .cse49 100000000)) (< .cse49 10000000))) (let ((.cse50 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse50 100000000)) (< .cse50 10000000))) (let ((.cse51 (mod (+ 51 c_main_~x~0) 4294967296))) (or (not (< .cse51 100000000)) (< .cse51 10000000))) (let ((.cse52 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse52 10000000) (not (< .cse52 100000000)))) (let ((.cse53 (mod (+ 91 c_main_~x~0) 4294967296))) (or (< .cse53 10000000) (not (< .cse53 100000000))))) is different from false [2022-04-06 10:09:59,668 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ c_main_~x~0 79) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ 94 c_main_~x~0) 4294967296))) (or (not (< .cse1 100000000)) (< .cse1 10000000))) (let ((.cse2 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse2 10000000) (not (< .cse2 100000000)))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse3 (mod (+ c_main_~x~0 93) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ 78 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 57 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 90 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 88 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ c_main_~x~0 80) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ c_main_~x~0 54) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ 84 c_main_~x~0) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ c_main_~x~0 86) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ 82 c_main_~x~0) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000)))) (let ((.cse24 (mod (+ 52 c_main_~x~0) 4294967296))) (or (< .cse24 10000000) (not (< .cse24 100000000)))) (let ((.cse25 (mod (+ 67 c_main_~x~0) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ 64 c_main_~x~0) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse27 10000000) (not (< .cse27 100000000)))) (let ((.cse28 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ 76 c_main_~x~0) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000)))) (let ((.cse30 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ 87 c_main_~x~0) 4294967296))) (or (not (< .cse31 100000000)) (< .cse31 10000000))) (let ((.cse32 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< .cse32 10000000) (not (< .cse32 100000000)))) (let ((.cse33 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse33 100000000)) (< .cse33 10000000))) (let ((.cse34 (mod (+ 53 c_main_~x~0) 4294967296))) (or (not (< .cse34 100000000)) (< .cse34 10000000))) (let ((.cse35 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse35 100000000)) (< .cse35 10000000))) (let ((.cse36 (mod (+ c_main_~x~0 83) 4294967296))) (or (< .cse36 10000000) (not (< .cse36 100000000)))) (let ((.cse37 (mod (+ 92 c_main_~x~0) 4294967296))) (or (not (< .cse37 100000000)) (< .cse37 10000000))) (let ((.cse38 (mod (+ 89 c_main_~x~0) 4294967296))) (or (< .cse38 10000000) (not (< .cse38 100000000)))) (let ((.cse39 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse39 100000000)) (< .cse39 10000000))) (let ((.cse40 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse40 100000000)) (< .cse40 10000000))) (let ((.cse41 (mod (+ 65 c_main_~x~0) 4294967296))) (or (not (< .cse41 100000000)) (< .cse41 10000000))) (let ((.cse42 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse42 100000000)) (< .cse42 10000000))) (let ((.cse43 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (< .cse43 100000000)) (< .cse43 10000000))) (let ((.cse44 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse44 100000000)) (< .cse44 10000000))) (let ((.cse45 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse45 10000000) (not (< .cse45 100000000)))) (let ((.cse46 (mod (+ 81 c_main_~x~0) 4294967296))) (or (< .cse46 10000000) (not (< .cse46 100000000)))) (let ((.cse47 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse47 10000000) (not (< .cse47 100000000)))) (let ((.cse48 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse48 10000000) (not (< .cse48 100000000)))) (let ((.cse49 (mod (+ 73 c_main_~x~0) 4294967296))) (or (not (< .cse49 100000000)) (< .cse49 10000000))) (let ((.cse50 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse50 10000000) (not (< .cse50 100000000)))) (let ((.cse51 (mod (+ 85 c_main_~x~0) 4294967296))) (or (< .cse51 10000000) (not (< .cse51 100000000)))) (let ((.cse52 (mod (+ 77 c_main_~x~0) 4294967296))) (or (not (< .cse52 100000000)) (< .cse52 10000000))) (let ((.cse53 (mod (+ 95 c_main_~x~0) 4294967296))) (or (< .cse53 10000000) (not (< .cse53 100000000)))) (let ((.cse54 (mod (+ c_main_~x~0 96) 4294967296))) (or (not (< .cse54 100000000)) (< .cse54 10000000))) (let ((.cse55 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse55 100000000)) (< .cse55 10000000))) (let ((.cse56 (mod (+ 51 c_main_~x~0) 4294967296))) (or (not (< .cse56 100000000)) (< .cse56 10000000))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (let ((.cse57 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse57 10000000) (not (< .cse57 100000000)))) (let ((.cse58 (mod (+ 91 c_main_~x~0) 4294967296))) (or (< .cse58 10000000) (not (< .cse58 100000000))))) is different from false [2022-04-06 10:10:01,684 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ c_main_~x~0 79) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ 94 c_main_~x~0) 4294967296))) (or (not (< .cse1 100000000)) (< .cse1 10000000))) (let ((.cse2 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse2 10000000) (not (< .cse2 100000000)))) (let ((.cse3 (mod (+ c_main_~x~0 93) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ 78 c_main_~x~0) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 57 c_main_~x~0) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 90 c_main_~x~0) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 88 c_main_~x~0) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ 48 c_main_~x~0) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ c_main_~x~0 80) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ c_main_~x~0 54) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ 42 c_main_~x~0) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ 84 c_main_~x~0) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ c_main_~x~0 86) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ c_main_~x~0 50) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ 82 c_main_~x~0) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000)))) (let ((.cse24 (mod (+ 52 c_main_~x~0) 4294967296))) (or (< .cse24 10000000) (not (< .cse24 100000000)))) (let ((.cse25 (mod (+ 67 c_main_~x~0) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ 64 c_main_~x~0) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse27 10000000) (not (< .cse27 100000000)))) (let ((.cse28 (mod (+ c_main_~x~0 61) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ 76 c_main_~x~0) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000)))) (let ((.cse30 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ 87 c_main_~x~0) 4294967296))) (or (not (< .cse31 100000000)) (< .cse31 10000000))) (let ((.cse32 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< .cse32 10000000) (not (< .cse32 100000000)))) (let ((.cse33 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (< .cse33 100000000)) (< .cse33 10000000))) (let ((.cse34 (mod (+ 53 c_main_~x~0) 4294967296))) (or (not (< .cse34 100000000)) (< .cse34 10000000))) (let ((.cse35 (mod (+ 70 c_main_~x~0) 4294967296))) (or (not (< .cse35 100000000)) (< .cse35 10000000))) (let ((.cse36 (mod (+ c_main_~x~0 83) 4294967296))) (or (< .cse36 10000000) (not (< .cse36 100000000)))) (let ((.cse37 (mod (+ 92 c_main_~x~0) 4294967296))) (or (not (< .cse37 100000000)) (< .cse37 10000000))) (let ((.cse38 (mod (+ 89 c_main_~x~0) 4294967296))) (or (< .cse38 10000000) (not (< .cse38 100000000)))) (let ((.cse39 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (< .cse39 100000000)) (< .cse39 10000000))) (let ((.cse40 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (< .cse40 100000000)) (< .cse40 10000000))) (let ((.cse41 (mod (+ 65 c_main_~x~0) 4294967296))) (or (not (< .cse41 100000000)) (< .cse41 10000000))) (let ((.cse42 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (< .cse42 100000000)) (< .cse42 10000000))) (let ((.cse43 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (< .cse43 100000000)) (< .cse43 10000000))) (let ((.cse44 (mod (+ 47 c_main_~x~0) 4294967296))) (or (not (< .cse44 100000000)) (< .cse44 10000000))) (let ((.cse45 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< .cse45 10000000) (not (< .cse45 100000000)))) (let ((.cse46 (mod (+ 81 c_main_~x~0) 4294967296))) (or (< .cse46 10000000) (not (< .cse46 100000000)))) (let ((.cse47 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse47 10000000) (not (< .cse47 100000000)))) (let ((.cse48 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< .cse48 10000000) (not (< .cse48 100000000)))) (let ((.cse49 (mod (+ 73 c_main_~x~0) 4294967296))) (or (not (< .cse49 100000000)) (< .cse49 10000000))) (let ((.cse50 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< .cse50 10000000) (not (< .cse50 100000000)))) (let ((.cse51 (mod (+ 85 c_main_~x~0) 4294967296))) (or (< .cse51 10000000) (not (< .cse51 100000000)))) (let ((.cse52 (mod (+ 77 c_main_~x~0) 4294967296))) (or (not (< .cse52 100000000)) (< .cse52 10000000))) (let ((.cse53 (mod (+ 95 c_main_~x~0) 4294967296))) (or (< .cse53 10000000) (not (< .cse53 100000000)))) (let ((.cse54 (mod (+ c_main_~x~0 96) 4294967296))) (or (not (< .cse54 100000000)) (< .cse54 10000000))) (let ((.cse55 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (< .cse55 100000000)) (< .cse55 10000000))) (let ((.cse56 (mod (+ 51 c_main_~x~0) 4294967296))) (or (not (< .cse56 100000000)) (< .cse56 10000000))) (let ((.cse57 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse57 10000000) (not (< .cse57 100000000)))) (let ((.cse58 (mod (+ 91 c_main_~x~0) 4294967296))) (or (< .cse58 10000000) (not (< .cse58 100000000))))) is different from false