/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/mono-crafted_10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7390193 [2022-04-05 05:57:01,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-05 05:57:01,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-05 05:57:01,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-05 05:57:01,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-05 05:57:01,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-05 05:57:01,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-05 05:57:01,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-05 05:57:01,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-05 05:57:01,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-05 05:57:01,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-05 05:57:01,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-05 05:57:01,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-05 05:57:01,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-05 05:57:01,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-05 05:57:01,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-05 05:57:01,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-05 05:57:01,288 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-05 05:57:01,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-05 05:57:01,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-05 05:57:01,297 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-05 05:57:01,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-05 05:57:01,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-05 05:57:01,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-05 05:57:01,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-05 05:57:01,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-05 05:57:01,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-05 05:57:01,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-05 05:57:01,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-05 05:57:01,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-05 05:57:01,309 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-05 05:57:01,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-05 05:57:01,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-05 05:57:01,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-05 05:57:01,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-05 05:57:01,312 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-05 05:57:01,313 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-05 05:57:01,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-05 05:57:01,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-05 05:57:01,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-05 05:57:01,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-05 05:57:01,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-05 05:57:01,316 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-05 05:57:01,339 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-05 05:57:01,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-05 05:57:01,341 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-05 05:57:01,341 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-05 05:57:01,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-05 05:57:01,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-05 05:57:01,342 INFO L138 SettingsManager]: * Use SBE=true [2022-04-05 05:57:01,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-05 05:57:01,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-05 05:57:01,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-05 05:57:01,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-05 05:57:01,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-05 05:57:01,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-05 05:57:01,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-05 05:57:01,344 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-05 05:57:01,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-05 05:57:01,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-05 05:57:01,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-05 05:57:01,344 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-05 05:57:01,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 05:57:01,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-05 05:57:01,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-05 05:57:01,345 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-05 05:57:01,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-05 05:57:01,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-05 05:57:01,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-05 05:57:01,346 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-05 05:57:01,346 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-05 05:57:01,347 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-05 05:57:01,347 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-05 05:57:01,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-05 05:57:01,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-05 05:57:01,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-05 05:57:01,605 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-05 05:57:01,606 INFO L275 PluginConnector]: CDTParser initialized [2022-04-05 05:57:01,607 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_10.c [2022-04-05 05:57:01,664 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b78af99fe/2fe1648ae5b34bc8b122c35fbab7bdaa/FLAG108a3eb02 [2022-04-05 05:57:02,044 INFO L306 CDTParser]: Found 1 translation units. [2022-04-05 05:57:02,045 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_10.c [2022-04-05 05:57:02,050 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b78af99fe/2fe1648ae5b34bc8b122c35fbab7bdaa/FLAG108a3eb02 [2022-04-05 05:57:02,070 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b78af99fe/2fe1648ae5b34bc8b122c35fbab7bdaa [2022-04-05 05:57:02,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-05 05:57:02,073 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-05 05:57:02,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-05 05:57:02,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-05 05:57:02,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-05 05:57:02,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:57:02" (1/1) ... [2022-04-05 05:57:02,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ccdb41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:57:02, skipping insertion in model container [2022-04-05 05:57:02,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 05:57:02" (1/1) ... [2022-04-05 05:57:02,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-05 05:57:02,097 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-05 05:57:02,244 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/mono-crafted_10.c[319,332] [2022-04-05 05:57:02,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 05:57:02,264 INFO L203 MainTranslator]: Completed pre-run [2022-04-05 05:57:02,274 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/mono-crafted_10.c[319,332] [2022-04-05 05:57:02,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 05:57:02,286 INFO L208 MainTranslator]: Completed translation [2022-04-05 05:57:02,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:57:02 WrapperNode [2022-04-05 05:57:02,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-05 05:57:02,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-05 05:57:02,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-05 05:57:02,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-05 05:57:02,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:57:02" (1/1) ... [2022-04-05 05:57:02,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:57:02" (1/1) ... [2022-04-05 05:57:02,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:57:02" (1/1) ... [2022-04-05 05:57:02,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:57:02" (1/1) ... [2022-04-05 05:57:02,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:57:02" (1/1) ... [2022-04-05 05:57:02,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:57:02" (1/1) ... [2022-04-05 05:57:02,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:57:02" (1/1) ... [2022-04-05 05:57:02,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-05 05:57:02,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-05 05:57:02,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-05 05:57:02,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-05 05:57:02,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:57:02" (1/1) ... [2022-04-05 05:57:02,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 05:57:02,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:57:02,344 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-05 05:57:02,366 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-05 05:57:02,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-05 05:57:02,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-05 05:57:02,379 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-05 05:57:02,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-05 05:57:02,380 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-05 05:57:02,380 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-05 05:57:02,380 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-05 05:57:02,381 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-05 05:57:02,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-05 05:57:02,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-05 05:57:02,381 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-05 05:57:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-05 05:57:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-05 05:57:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-05 05:57:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-05 05:57:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-05 05:57:02,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-05 05:57:02,438 INFO L234 CfgBuilder]: Building ICFG [2022-04-05 05:57:02,439 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-05 05:57:02,529 INFO L275 CfgBuilder]: Performing block encoding [2022-04-05 05:57:02,533 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-05 05:57:02,533 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-05 05:57:02,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:57:02 BoogieIcfgContainer [2022-04-05 05:57:02,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-05 05:57:02,536 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-05 05:57:02,536 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-05 05:57:02,536 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-05 05:57:02,539 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:57:02" (1/1) ... [2022-04-05 05:57:02,541 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-05 05:57:02,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 05:57:02 BasicIcfg [2022-04-05 05:57:02,551 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-05 05:57:02,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-05 05:57:02,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-05 05:57:02,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-05 05:57:02,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 05:57:02" (1/4) ... [2022-04-05 05:57:02,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a94ee41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:57:02, skipping insertion in model container [2022-04-05 05:57:02,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 05:57:02" (2/4) ... [2022-04-05 05:57:02,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a94ee41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 05:57:02, skipping insertion in model container [2022-04-05 05:57:02,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 05:57:02" (3/4) ... [2022-04-05 05:57:02,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a94ee41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 05:57:02, skipping insertion in model container [2022-04-05 05:57:02,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 05:57:02" (4/4) ... [2022-04-05 05:57:02,557 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_10.cqvasr [2022-04-05 05:57:02,575 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-05 05:57:02,575 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-05 05:57:02,626 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-05 05:57:02,648 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-05 05:57:02,648 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-05 05:57:02,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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-05 05:57:02,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-05 05:57:02,670 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:57:02,670 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:57:02,671 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:57:02,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:57:02,675 INFO L85 PathProgramCache]: Analyzing trace with hash 447419557, now seen corresponding path program 1 times [2022-04-05 05:57:02,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:57:02,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068649830] [2022-04-05 05:57:02,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:57:02,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:57:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:57:02,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:57:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:57:02,868 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-05 05:57:02,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:57:02,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068649830] [2022-04-05 05:57:02,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068649830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:57:02,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:57:02,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-05 05:57:02,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051517459] [2022-04-05 05:57:02,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:57:02,875 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-05 05:57:02,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:57:02,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-05 05:57:02,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-05 05:57:02,902 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 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-05 05:57:02,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:57:02,945 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-05 05:57:02,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-05 05:57:02,947 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-05 05:57:02,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:57:02,954 INFO L225 Difference]: With dead ends: 33 [2022-04-05 05:57:02,954 INFO L226 Difference]: Without dead ends: 14 [2022-04-05 05:57:02,957 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-05 05:57:02,962 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 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-05 05:57:02,963 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 05:57:02,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-05 05:57:02,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-05 05:57:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-05 05:57:02,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-05 05:57:02,993 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-05 05:57:02,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:57:02,994 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-05 05:57:02,994 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-05 05:57:02,995 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-05 05:57:02,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-05 05:57:02,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:57:02,996 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:57:02,996 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-05 05:57:02,996 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:57:02,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:57:02,999 INFO L85 PathProgramCache]: Analyzing trace with hash 448343078, now seen corresponding path program 1 times [2022-04-05 05:57:02,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:57:02,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495800627] [2022-04-05 05:57:02,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:57:03,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:57:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:57:03,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:57:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:57:03,177 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-05 05:57:03,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:57:03,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495800627] [2022-04-05 05:57:03,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495800627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 05:57:03,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 05:57:03,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-05 05:57:03,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314744936] [2022-04-05 05:57:03,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 05:57:03,180 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-05 05:57:03,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:57:03,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-05 05:57:03,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-05 05:57:03,182 INFO L87 Difference]: Start difference. First operand 14 states and 15 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-05 05:57:03,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:57:03,231 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-05 05:57:03,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-05 05:57:03,232 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-05 05:57:03,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:57:03,232 INFO L225 Difference]: With dead ends: 25 [2022-04-05 05:57:03,232 INFO L226 Difference]: Without dead ends: 17 [2022-04-05 05:57:03,236 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-05 05:57:03,237 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 05:57:03,238 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 05:57:03,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-05 05:57:03,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-05 05:57:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-05 05:57:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-05 05:57:03,250 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-05 05:57:03,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:57:03,255 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-05 05:57:03,255 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-05 05:57:03,255 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-05 05:57:03,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-05 05:57:03,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:57:03,256 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:57:03,257 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-05 05:57:03,257 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:57:03,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:57:03,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1516694440, now seen corresponding path program 1 times [2022-04-05 05:57:03,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:57:03,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384622579] [2022-04-05 05:57:03,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:57:03,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:57:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:57:03,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:57:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:57:03,406 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-05 05:57:03,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:57:03,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384622579] [2022-04-05 05:57:03,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384622579] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:57:03,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323688490] [2022-04-05 05:57:03,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:57:03,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:57:03,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:57:03,409 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-05 05:57:03,410 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-05 05:57:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:57:03,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-05 05:57:03,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:57:03,576 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-05 05:57:03,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:57:03,629 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-05 05:57:03,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323688490] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:57:03,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:57:03,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-04-05 05:57:03,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056012361] [2022-04-05 05:57:03,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:57:03,630 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-05 05:57:03,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:57:03,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-05 05:57:03,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-05 05:57:03,631 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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-05 05:57:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:57:03,735 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-05 05:57:03,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 05:57:03,736 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 14 [2022-04-05 05:57:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:57:03,736 INFO L225 Difference]: With dead ends: 32 [2022-04-05 05:57:03,737 INFO L226 Difference]: Without dead ends: 24 [2022-04-05 05:57:03,737 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-04-05 05:57:03,738 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 05:57:03,739 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 28 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 05:57:03,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-05 05:57:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-05 05:57:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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-05 05:57:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-05 05:57:03,744 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2022-04-05 05:57:03,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:57:03,744 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-05 05:57:03,744 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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-05 05:57:03,744 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-05 05:57:03,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-05 05:57:03,745 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:57:03,745 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:57:03,766 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-05 05:57:03,959 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-05 05:57:03,960 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:57:03,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:57:03,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1579293370, now seen corresponding path program 1 times [2022-04-05 05:57:03,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:57:03,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138368168] [2022-04-05 05:57:03,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:57:03,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:57:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:57:04,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:57:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:57:04,069 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-05 05:57:04,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:57:04,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138368168] [2022-04-05 05:57:04,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138368168] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:57:04,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265920494] [2022-04-05 05:57:04,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:57:04,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:57:04,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:57:04,074 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-05 05:57:04,075 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-05 05:57:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:57:04,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-05 05:57:04,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:57:04,210 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-05 05:57:04,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:57:04,519 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:57:04,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265920494] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:57:04,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:57:04,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 15 [2022-04-05 05:57:04,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711268970] [2022-04-05 05:57:04,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:57:04,520 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-05 05:57:04,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:57:04,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-05 05:57:04,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-04-05 05:57:04,521 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 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-05 05:57:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:57:05,881 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2022-04-05 05:57:05,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-05 05:57:05,881 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 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 23 [2022-04-05 05:57:05,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:57:05,883 INFO L225 Difference]: With dead ends: 50 [2022-04-05 05:57:05,883 INFO L226 Difference]: Without dead ends: 40 [2022-04-05 05:57:05,883 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=225, Invalid=587, Unknown=0, NotChecked=0, Total=812 [2022-04-05 05:57:05,884 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 95 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-05 05:57:05,884 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 47 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-05 05:57:05,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-05 05:57:05,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2022-04-05 05:57:05,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 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-05 05:57:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-05 05:57:05,893 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 23 [2022-04-05 05:57:05,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:57:05,893 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-05 05:57:05,894 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 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-05 05:57:05,894 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-05 05:57:05,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-05 05:57:05,894 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:57:05,894 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:57:05,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-05 05:57:06,111 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-05 05:57:06,112 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:57:06,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:57:06,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1775806875, now seen corresponding path program 2 times [2022-04-05 05:57:06,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:57:06,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262281440] [2022-04-05 05:57:06,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:57:06,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:57:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:57:06,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:57:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:57:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:57:06,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:57:06,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262281440] [2022-04-05 05:57:06,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262281440] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:57:06,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490761568] [2022-04-05 05:57:06,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 05:57:06,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:57:06,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:57:06,206 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-05 05:57:06,225 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-05 05:57:06,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 05:57:06,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 05:57:06,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-05 05:57:06,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:57:06,379 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:57:06,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:57:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:57:06,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490761568] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:57:06,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:57:06,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9] total 18 [2022-04-05 05:57:06,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432657489] [2022-04-05 05:57:06,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:57:06,629 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-05 05:57:06,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:57:06,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-05 05:57:06,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2022-04-05 05:57:06,630 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 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-05 05:57:08,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:57:08,358 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2022-04-05 05:57:08,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-05 05:57:08,358 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 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 23 [2022-04-05 05:57:08,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:57:08,360 INFO L225 Difference]: With dead ends: 79 [2022-04-05 05:57:08,360 INFO L226 Difference]: Without dead ends: 65 [2022-04-05 05:57:08,360 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=305, Invalid=751, Unknown=0, NotChecked=0, Total=1056 [2022-04-05 05:57:08,361 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 91 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-05 05:57:08,361 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 57 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-05 05:57:08,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-05 05:57:08,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2022-04-05 05:57:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 56 states have internal predecessors, (68), 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-05 05:57:08,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2022-04-05 05:57:08,373 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 23 [2022-04-05 05:57:08,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:57:08,373 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2022-04-05 05:57:08,373 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 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-05 05:57:08,373 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-04-05 05:57:08,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-05 05:57:08,374 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:57:08,374 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:57:08,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-05 05:57:08,587 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-05 05:57:08,587 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:57:08,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:57:08,588 INFO L85 PathProgramCache]: Analyzing trace with hash 230239334, now seen corresponding path program 2 times [2022-04-05 05:57:08,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:57:08,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294937820] [2022-04-05 05:57:08,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:57:08,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:57:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:57:08,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:57:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:57:08,776 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:57:08,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:57:08,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294937820] [2022-04-05 05:57:08,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294937820] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:57:08,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923544266] [2022-04-05 05:57:08,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-05 05:57:08,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:57:08,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:57:08,780 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-05 05:57:08,788 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-05 05:57:08,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-05 05:57:08,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 05:57:08,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-05 05:57:08,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:57:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:57:09,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:57:09,435 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 05:57:09,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923544266] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:57:09,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:57:09,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 12] total 28 [2022-04-05 05:57:09,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965512318] [2022-04-05 05:57:09,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:57:09,436 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-05 05:57:09,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:57:09,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-05 05:57:09,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2022-04-05 05:57:09,437 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 26 states have internal predecessors, (68), 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-05 05:57:16,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:57:16,943 INFO L93 Difference]: Finished difference Result 101 states and 126 transitions. [2022-04-05 05:57:16,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-05 05:57:16,944 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 26 states have internal predecessors, (68), 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 29 [2022-04-05 05:57:16,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:57:16,944 INFO L225 Difference]: With dead ends: 101 [2022-04-05 05:57:16,944 INFO L226 Difference]: Without dead ends: 57 [2022-04-05 05:57:16,945 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=506, Invalid=2044, Unknown=0, NotChecked=0, Total=2550 [2022-04-05 05:57:16,946 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 91 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-05 05:57:16,946 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 56 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-05 05:57:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-05 05:57:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2022-04-05 05:57:16,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 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-05 05:57:16,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-04-05 05:57:16,958 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 29 [2022-04-05 05:57:16,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:57:16,958 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-04-05 05:57:16,958 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 26 states have internal predecessors, (68), 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-05 05:57:16,958 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-04-05 05:57:16,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-05 05:57:16,959 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:57:16,959 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:57:16,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-05 05:57:17,167 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-05 05:57:17,168 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:57:17,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:57:17,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1671627528, now seen corresponding path program 3 times [2022-04-05 05:57:17,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:57:17,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506180921] [2022-04-05 05:57:17,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:57:17,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:57:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:57:17,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:57:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:57:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 38 proven. 77 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-05 05:57:17,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:57:17,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506180921] [2022-04-05 05:57:17,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506180921] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:57:17,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487824979] [2022-04-05 05:57:17,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-05 05:57:17,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:57:17,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:57:17,312 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-05 05:57:17,313 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-05 05:57:17,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-04-05 05:57:17,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 05:57:17,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-05 05:57:17,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:57:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 53 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-04-05 05:57:17,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:57:17,918 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-05 05:57:17,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487824979] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:57:17,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:57:17,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 24 [2022-04-05 05:57:17,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479164854] [2022-04-05 05:57:17,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:57:17,919 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-05 05:57:17,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:57:17,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-05 05:57:17,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2022-04-05 05:57:17,920 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 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-05 05:57:18,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:57:18,915 INFO L93 Difference]: Finished difference Result 85 states and 106 transitions. [2022-04-05 05:57:18,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-05 05:57:18,916 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 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 38 [2022-04-05 05:57:18,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:57:18,916 INFO L225 Difference]: With dead ends: 85 [2022-04-05 05:57:18,916 INFO L226 Difference]: Without dead ends: 75 [2022-04-05 05:57:18,917 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=458, Invalid=1348, Unknown=0, NotChecked=0, Total=1806 [2022-04-05 05:57:18,918 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 193 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-05 05:57:18,918 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 77 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-05 05:57:18,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-05 05:57:18,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2022-04-05 05:57:18,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 states have internal predecessors, (61), 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-05 05:57:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2022-04-05 05:57:18,928 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 38 [2022-04-05 05:57:18,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:57:18,928 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2022-04-05 05:57:18,928 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 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-05 05:57:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-04-05 05:57:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-05 05:57:18,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:57:18,930 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:57:18,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-05 05:57:19,150 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-05 05:57:19,151 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:57:19,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:57:19,151 INFO L85 PathProgramCache]: Analyzing trace with hash -94615547, now seen corresponding path program 4 times [2022-04-05 05:57:19,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:57:19,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328831646] [2022-04-05 05:57:19,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:57:19,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:57:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:57:19,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:57:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:57:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 193 proven. 126 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-04-05 05:57:19,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:57:19,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328831646] [2022-04-05 05:57:19,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328831646] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:57:19,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736453779] [2022-04-05 05:57:19,331 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-05 05:57:19,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:57:19,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:57:19,332 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-05 05:57:19,332 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-05 05:57:19,373 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-05 05:57:19,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 05:57:19,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-05 05:57:19,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:57:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 163 proven. 187 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-05 05:57:19,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:57:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 163 proven. 187 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-05 05:57:20,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736453779] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:57:20,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:57:20,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 29 [2022-04-05 05:57:20,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840754876] [2022-04-05 05:57:20,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:57:20,177 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-05 05:57:20,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:57:20,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-05 05:57:20,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=577, Unknown=0, NotChecked=0, Total=812 [2022-04-05 05:57:20,178 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 29 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 28 states have internal predecessors, (85), 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-05 05:57:26,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 05:57:26,133 INFO L93 Difference]: Finished difference Result 133 states and 158 transitions. [2022-04-05 05:57:26,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-05 05:57:26,133 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 28 states have internal predecessors, (85), 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 59 [2022-04-05 05:57:26,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 05:57:26,134 INFO L225 Difference]: With dead ends: 133 [2022-04-05 05:57:26,134 INFO L226 Difference]: Without dead ends: 105 [2022-04-05 05:57:26,135 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=785, Invalid=1971, Unknown=0, NotChecked=0, Total=2756 [2022-04-05 05:57:26,136 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 155 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-05 05:57:26,136 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 104 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-05 05:57:26,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-05 05:57:26,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-04-05 05:57:26,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.06) internal successors, (106), 100 states have internal predecessors, (106), 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-05 05:57:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2022-04-05 05:57:26,150 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 59 [2022-04-05 05:57:26,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 05:57:26,150 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2022-04-05 05:57:26,150 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 28 states have internal predecessors, (85), 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-05 05:57:26,150 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2022-04-05 05:57:26,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-05 05:57:26,152 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 05:57:26,153 INFO L499 BasicCegarLoop]: trace histogram [31, 31, 24, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 05:57:26,173 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-05 05:57:26,367 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-05 05:57:26,367 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 05:57:26,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 05:57:26,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1594700023, now seen corresponding path program 5 times [2022-04-05 05:57:26,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 05:57:26,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827136394] [2022-04-05 05:57:26,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 05:57:26,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 05:57:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:57:26,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 05:57:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 05:57:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 493 proven. 876 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-04-05 05:57:26,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 05:57:26,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827136394] [2022-04-05 05:57:26,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827136394] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 05:57:26,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173976816] [2022-04-05 05:57:26,862 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-05 05:57:26,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 05:57:26,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 05:57:26,863 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-05 05:57:26,897 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-05 05:57:47,664 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2022-04-05 05:57:47,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 05:57:47,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 62 conjunts are in the unsatisfiable core [2022-04-05 05:57:47,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 05:57:48,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 148 proven. 1276 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-05 05:57:48,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 05:57:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 148 proven. 1276 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-05 05:57:50,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173976816] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 05:57:50,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 05:57:50,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32, 33] total 65 [2022-04-05 05:57:50,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737066185] [2022-04-05 05:57:50,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 05:57:50,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-05 05:57:50,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 05:57:50,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-05 05:57:50,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1114, Invalid=3046, Unknown=0, NotChecked=0, Total=4160 [2022-04-05 05:57:50,160 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 65 states, 65 states have (on average 2.9692307692307693) internal successors, (193), 64 states have internal predecessors, (193), 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-05 05:58:14,477 WARN L232 SmtUtils]: Spent 5.71s on a formula simplification. DAG size of input: 217 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 05:58:33,809 WARN L232 SmtUtils]: Spent 6.74s on a formula simplification. DAG size of input: 210 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 05:59:05,340 WARN L232 SmtUtils]: Spent 8.94s on a formula simplification. DAG size of input: 203 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 06:04:41,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:04:41,254 INFO L93 Difference]: Finished difference Result 241 states and 287 transitions. [2022-04-05 06:04:41,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-05 06:04:41,255 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.9692307692307693) internal successors, (193), 64 states have internal predecessors, (193), 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 104 [2022-04-05 06:04:41,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:04:41,258 INFO L225 Difference]: With dead ends: 241 [2022-04-05 06:04:41,258 INFO L226 Difference]: Without dead ends: 213 [2022-04-05 06:04:41,262 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 173 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1925 ImplicationChecksByTransitivity, 411.6s TimeCoverageRelationStatistics Valid=4101, Invalid=11388, Unknown=11, NotChecked=0, Total=15500 [2022-04-05 06:04:41,263 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 471 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2830 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 2974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 2830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-05 06:04:41,264 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [471 Valid, 164 Invalid, 2974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 2830 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-05 06:04:41,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-04-05 06:04:41,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2022-04-05 06:04:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 208 states have (on average 1.0288461538461537) internal successors, (214), 208 states have internal predecessors, (214), 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-05 06:04:41,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 218 transitions. [2022-04-05 06:04:41,298 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 218 transitions. Word has length 104 [2022-04-05 06:04:41,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:04:41,299 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 218 transitions. [2022-04-05 06:04:41,299 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.9692307692307693) internal successors, (193), 64 states have internal predecessors, (193), 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-05 06:04:41,299 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 218 transitions. [2022-04-05 06:04:41,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-04-05 06:04:41,302 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:04:41,302 INFO L499 BasicCegarLoop]: trace histogram [67, 67, 60, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:04:41,309 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-05 06:04:41,509 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-05 06:04:41,509 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:04:41,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:04:41,510 INFO L85 PathProgramCache]: Analyzing trace with hash -739897481, now seen corresponding path program 6 times [2022-04-05 06:04:41,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:04:41,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518494599] [2022-04-05 06:04:41,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:04:41,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:04:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:04:43,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:04:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:04:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 1213 proven. 5430 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-04-05 06:04:43,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:04:43,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518494599] [2022-04-05 06:04:43,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518494599] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:04:43,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105336747] [2022-04-05 06:04:43,501 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-05 06:04:43,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:04:43,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:04:43,503 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-05 06:04:43,507 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-05 06:04:46,533 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-05 06:04:46,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-05 06:04:46,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-05 06:04:46,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:04:48,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 1372 proven. 77 refuted. 0 times theorem prover too weak. 5251 trivial. 0 not checked. [2022-04-05 06:04:48,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:04:52,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 0 proven. 1449 refuted. 0 times theorem prover too weak. 5251 trivial. 0 not checked. [2022-04-05 06:04:52,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105336747] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:04:52,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 06:04:52,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 13, 16] total 89 [2022-04-05 06:04:52,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106661139] [2022-04-05 06:04:52,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 06:04:52,366 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-04-05 06:04:52,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:04:52,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-04-05 06:04:52,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1063, Invalid=6769, Unknown=0, NotChecked=0, Total=7832 [2022-04-05 06:04:52,369 INFO L87 Difference]: Start difference. First operand 213 states and 218 transitions. Second operand has 89 states, 89 states have (on average 2.797752808988764) internal successors, (249), 88 states have internal predecessors, (249), 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-05 06:05:57,114 WARN L232 SmtUtils]: Spent 23.81s on a formula simplification. DAG size of input: 80 DAG size of output: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-05 06:05:57,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 06:05:57,677 INFO L93 Difference]: Finished difference Result 278 states and 310 transitions. [2022-04-05 06:05:57,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-04-05 06:05:57,678 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 2.797752808988764) internal successors, (249), 88 states have internal predecessors, (249), 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 212 [2022-04-05 06:05:57,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 06:05:57,679 INFO L225 Difference]: With dead ends: 278 [2022-04-05 06:05:57,679 INFO L226 Difference]: Without dead ends: 250 [2022-04-05 06:05:57,685 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 397 SyntacticMatches, 6 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3680 ImplicationChecksByTransitivity, 61.4s TimeCoverageRelationStatistics Valid=3827, Invalid=25585, Unknown=0, NotChecked=0, Total=29412 [2022-04-05 06:05:57,686 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1260 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 13994 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 14483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 13994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-04-05 06:05:57,686 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1260 Valid, 102 Invalid, 14483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 13994 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2022-04-05 06:05:57,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-04-05 06:05:57,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2022-04-05 06:05:57,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 244 states have (on average 1.0450819672131149) internal successors, (255), 244 states have internal predecessors, (255), 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-05 06:05:57,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 259 transitions. [2022-04-05 06:05:57,723 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 259 transitions. Word has length 212 [2022-04-05 06:05:57,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 06:05:57,723 INFO L478 AbstractCegarLoop]: Abstraction has 249 states and 259 transitions. [2022-04-05 06:05:57,726 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 2.797752808988764) internal successors, (249), 88 states have internal predecessors, (249), 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-05 06:05:57,726 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 259 transitions. [2022-04-05 06:05:57,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-04-05 06:05:57,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 06:05:57,728 INFO L499 BasicCegarLoop]: trace histogram [79, 79, 62, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 06:05:57,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-05 06:05:57,933 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-05 06:05:57,934 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 06:05:57,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 06:05:57,934 INFO L85 PathProgramCache]: Analyzing trace with hash 255938775, now seen corresponding path program 7 times [2022-04-05 06:05:57,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 06:05:57,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499391142] [2022-04-05 06:05:57,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 06:05:57,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 06:05:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:05:59,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 06:05:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:05:59,968 INFO L134 CoverageAnalysis]: Checked inductivity of 9322 backedges. 3133 proven. 5797 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2022-04-05 06:05:59,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 06:05:59,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499391142] [2022-04-05 06:05:59,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499391142] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 06:05:59,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267141173] [2022-04-05 06:05:59,969 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-05 06:05:59,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 06:05:59,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 06:05:59,971 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 06:06:00,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-05 06:06:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 06:06:00,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 158 conjunts are in the unsatisfiable core [2022-04-05 06:06:00,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 06:06:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 9322 backedges. 388 proven. 8932 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-05 06:06:01,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-05 06:06:12,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9322 backedges. 388 proven. 8932 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-05 06:06:12,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267141173] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-05 06:06:12,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-05 06:06:12,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 80, 81] total 161 [2022-04-05 06:06:12,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594881152] [2022-04-05 06:06:12,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-05 06:06:12,542 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 161 states [2022-04-05 06:06:12,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 06:06:12,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2022-04-05 06:06:12,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6624, Invalid=19136, Unknown=0, NotChecked=0, Total=25760 [2022-04-05 06:06:12,545 INFO L87 Difference]: Start difference. First operand 249 states and 259 transitions. Second operand has 161 states, 161 states have (on average 2.987577639751553) internal successors, (481), 160 states have internal predecessors, (481), 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-05 06:06:23,023 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 19 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse0)) (<= 4294967295 .cse0))) (let ((.cse1 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse1)) (<= 4294967295 .cse1))) (= |c_#NULL.base| |c_old(#NULL.base)|) (let ((.cse2 (mod (+ 40 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse2)) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ c_main_~x~0 75) 4294967296))) (or (not (<= 5000000 .cse3)) (<= 4294967295 .cse3))) (let ((.cse4 (mod (+ 17 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 63 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse5)) (<= 4294967295 .cse5))) (let ((.cse6 (mod (+ 14 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ 51 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 52 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse8) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ c_main_~x~0 11) 4294967296))) (or (<= 4294967295 .cse9) (not (<= 5000000 .cse9)))) (let ((.cse10 (mod (+ 2 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse10)) (<= 4294967295 .cse10))) (let ((.cse11 (mod (+ 7 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ 13 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse13)) (<= 4294967295 .cse13))) (let ((.cse14 (mod (+ 47 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ 72 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse15)) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse16)) (<= 4294967295 .cse16))) (let ((.cse17 (mod (+ 58 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse17)) (<= 4294967295 .cse17))) (let ((.cse18 (mod (+ 57 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse19)) (<= 4294967295 .cse19))) (let ((.cse20 (mod (+ 76 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse20)) (<= 4294967295 .cse20))) (let ((.cse21 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse21)) (<= 4294967295 .cse21))) (let ((.cse22 (mod (+ 3 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ 39 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse23) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ 65 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ 9 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse25) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ 67 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse26) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ c_main_~x~0 50) 4294967296))) (or (<= 4294967295 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse28)) (<= 4294967295 .cse28))) (let ((.cse29 (mod (+ 44 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse29)) (<= 4294967295 .cse29))) (let ((.cse30 (mod (+ 74 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse30)) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ 60 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse31)) (<= 4294967295 .cse31))) (let ((.cse32 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse32)) (<= 4294967295 .cse32))) (let ((.cse33 (mod (+ 53 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ c_main_~x~0 24) 4294967296))) (or (<= 4294967295 .cse34) (not (<= 5000000 .cse34)))) (let ((.cse35 (mod (+ c_main_~x~0 1) 4294967296))) (or (not (<= 5000000 .cse35)) (<= 4294967295 .cse35))) (let ((.cse36 (mod (+ 16 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse36) (not (<= 5000000 .cse36)))) (let ((.cse37 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse37)) (<= 4294967295 .cse37))) (let ((.cse38 (mod (+ 25 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse38)) (<= 4294967295 .cse38))) (let ((.cse39 (mod (+ 33 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse39) (not (<= 5000000 .cse39)))) (let ((.cse40 (mod (+ 6 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse40) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ 21 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse41) (not (<= 5000000 .cse41)))) (let ((.cse42 (mod (+ 26 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse42) (not (<= 5000000 .cse42)))) (let ((.cse43 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse43)) (<= 4294967295 .cse43))) (let ((.cse44 (mod (+ c_main_~x~0 54) 4294967296))) (or (<= 4294967295 .cse44) (not (<= 5000000 .cse44)))) (let ((.cse45 (mod (+ 10 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse45) (not (<= 5000000 .cse45)))) (let ((.cse46 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse46)) (<= 4294967295 .cse46))) (let ((.cse47 (mod (+ c_main_~x~0 37) 4294967296))) (or (<= 4294967295 .cse47) (not (<= 5000000 .cse47)))) (let ((.cse48 (mod (+ 73 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse48) (not (<= 5000000 .cse48)))) (let ((.cse49 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse49)) (<= 4294967295 .cse49))) (let ((.cse50 (mod (+ 5 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse50)) (<= 4294967295 .cse50))) (let ((.cse51 (mod (+ 42 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse51) (not (<= 5000000 .cse51)))) (let ((.cse52 (mod (+ 4 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse52)) (<= 4294967295 .cse52))) (let ((.cse53 (mod (+ 23 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse53)) (<= 4294967295 .cse53))) (let ((.cse54 (mod (+ c_main_~x~0 27) 4294967296))) (or (not (<= 5000000 .cse54)) (<= 4294967295 .cse54))) (let ((.cse55 (mod (+ 48 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse55) (not (<= 5000000 .cse55)))) (let ((.cse56 (mod (+ 12 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse56)) (<= 4294967295 .cse56))) (let ((.cse57 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse57)) (<= 4294967295 .cse57))) (let ((.cse58 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse58)) (<= 4294967295 .cse58))) (let ((.cse59 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse59)) (<= 4294967295 .cse59))) (let ((.cse60 (mod (+ 62 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse60)) (<= 4294967295 .cse60))) (let ((.cse61 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse61)) (<= 4294967295 .cse61))) (let ((.cse62 (mod (+ 36 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse62) (not (<= 5000000 .cse62)))) (let ((.cse63 (mod (+ 22 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse63) (not (<= 5000000 .cse63)))) (not (<= 5000000 (mod c_main_~x~0 4294967296))) (let ((.cse64 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse64)) (<= 4294967295 .cse64))) (let ((.cse65 (mod (+ 70 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse65) (not (<= 5000000 .cse65)))) (let ((.cse66 (mod (+ 20 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse66) (not (<= 5000000 .cse66)))) (let ((.cse67 (mod (+ 29 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse67) (not (<= 5000000 .cse67)))) (let ((.cse68 (mod (+ 69 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse68) (not (<= 5000000 .cse68)))) (let ((.cse69 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse69)) (<= 4294967295 .cse69))) (let ((.cse70 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse70)) (<= 4294967295 .cse70))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (let ((.cse71 (mod (+ 8 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse71) (not (<= 5000000 .cse71)))) (let ((.cse72 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse72)) (<= 4294967295 .cse72))) (let ((.cse73 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse73)) (<= 4294967295 .cse73))) (let ((.cse74 (mod (+ 77 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse74)) (<= 4294967295 .cse74))) (let ((.cse75 (mod (+ 15 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse75) (not (<= 5000000 .cse75)))) (let ((.cse76 (mod (+ c_main_~x~0 61) 4294967296))) (or (<= 4294967295 .cse76) (not (<= 5000000 .cse76))))) is different from false [2022-04-05 06:06:25,052 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 19 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse0)) (<= 4294967295 .cse0))) (let ((.cse1 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse1)) (<= 4294967295 .cse1))) (let ((.cse2 (mod (+ 40 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse2)) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ c_main_~x~0 75) 4294967296))) (or (not (<= 5000000 .cse3)) (<= 4294967295 .cse3))) (let ((.cse4 (mod (+ 17 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 63 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse5)) (<= 4294967295 .cse5))) (let ((.cse6 (mod (+ 14 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ 51 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 52 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse8) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ c_main_~x~0 11) 4294967296))) (or (<= 4294967295 .cse9) (not (<= 5000000 .cse9)))) (let ((.cse10 (mod (+ 2 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse10)) (<= 4294967295 .cse10))) (let ((.cse11 (mod (+ 7 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ 13 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse13)) (<= 4294967295 .cse13))) (let ((.cse14 (mod (+ 47 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ 72 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse15)) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse16)) (<= 4294967295 .cse16))) (let ((.cse17 (mod (+ 58 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse17)) (<= 4294967295 .cse17))) (let ((.cse18 (mod (+ 57 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse19)) (<= 4294967295 .cse19))) (let ((.cse20 (mod (+ 76 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse20)) (<= 4294967295 .cse20))) (let ((.cse21 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse21)) (<= 4294967295 .cse21))) (let ((.cse22 (mod (+ 3 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ 39 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse23) (not (<= 5000000 .cse23)))) (let ((.cse24 (mod (+ 65 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ 9 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse25) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ 67 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse26) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ c_main_~x~0 50) 4294967296))) (or (<= 4294967295 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse28)) (<= 4294967295 .cse28))) (let ((.cse29 (mod (+ 44 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse29)) (<= 4294967295 .cse29))) (let ((.cse30 (mod (+ 74 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse30)) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ 60 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse31)) (<= 4294967295 .cse31))) (let ((.cse32 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse32)) (<= 4294967295 .cse32))) (let ((.cse33 (mod (+ 53 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ c_main_~x~0 24) 4294967296))) (or (<= 4294967295 .cse34) (not (<= 5000000 .cse34)))) (let ((.cse35 (mod (+ c_main_~x~0 1) 4294967296))) (or (not (<= 5000000 .cse35)) (<= 4294967295 .cse35))) (let ((.cse36 (mod (+ 16 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse36) (not (<= 5000000 .cse36)))) (let ((.cse37 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse37)) (<= 4294967295 .cse37))) (let ((.cse38 (mod (+ 25 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse38)) (<= 4294967295 .cse38))) (let ((.cse39 (mod (+ 33 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse39) (not (<= 5000000 .cse39)))) (let ((.cse40 (mod (+ 6 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse40) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ 21 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse41) (not (<= 5000000 .cse41)))) (let ((.cse42 (mod (+ 26 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse42) (not (<= 5000000 .cse42)))) (let ((.cse43 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse43)) (<= 4294967295 .cse43))) (let ((.cse44 (mod (+ c_main_~x~0 54) 4294967296))) (or (<= 4294967295 .cse44) (not (<= 5000000 .cse44)))) (let ((.cse45 (mod (+ 10 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse45) (not (<= 5000000 .cse45)))) (let ((.cse46 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse46)) (<= 4294967295 .cse46))) (let ((.cse47 (mod (+ c_main_~x~0 37) 4294967296))) (or (<= 4294967295 .cse47) (not (<= 5000000 .cse47)))) (let ((.cse48 (mod (+ 73 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse48) (not (<= 5000000 .cse48)))) (let ((.cse49 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse49)) (<= 4294967295 .cse49))) (let ((.cse50 (mod (+ 5 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse50)) (<= 4294967295 .cse50))) (let ((.cse51 (mod (+ 42 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse51) (not (<= 5000000 .cse51)))) (let ((.cse52 (mod (+ 4 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse52)) (<= 4294967295 .cse52))) (let ((.cse53 (mod (+ 23 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse53)) (<= 4294967295 .cse53))) (let ((.cse54 (mod (+ c_main_~x~0 27) 4294967296))) (or (not (<= 5000000 .cse54)) (<= 4294967295 .cse54))) (let ((.cse55 (mod (+ 48 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse55) (not (<= 5000000 .cse55)))) (let ((.cse56 (mod (+ 12 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse56)) (<= 4294967295 .cse56))) (let ((.cse57 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse57)) (<= 4294967295 .cse57))) (let ((.cse58 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse58)) (<= 4294967295 .cse58))) (let ((.cse59 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse59)) (<= 4294967295 .cse59))) (let ((.cse60 (mod (+ 62 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse60)) (<= 4294967295 .cse60))) (let ((.cse61 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse61)) (<= 4294967295 .cse61))) (let ((.cse62 (mod (+ 36 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse62) (not (<= 5000000 .cse62)))) (let ((.cse63 (mod (+ 22 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse63) (not (<= 5000000 .cse63)))) (not (<= 5000000 (mod c_main_~x~0 4294967296))) (let ((.cse64 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse64)) (<= 4294967295 .cse64))) (let ((.cse65 (mod (+ 70 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse65) (not (<= 5000000 .cse65)))) (let ((.cse66 (mod (+ 20 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse66) (not (<= 5000000 .cse66)))) (let ((.cse67 (mod (+ 29 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse67) (not (<= 5000000 .cse67)))) (let ((.cse68 (mod (+ 69 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse68) (not (<= 5000000 .cse68)))) (let ((.cse69 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse69)) (<= 4294967295 .cse69))) (let ((.cse70 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse70)) (<= 4294967295 .cse70))) (let ((.cse71 (mod (+ 8 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse71) (not (<= 5000000 .cse71)))) (let ((.cse72 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse72)) (<= 4294967295 .cse72))) (let ((.cse73 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse73)) (<= 4294967295 .cse73))) (let ((.cse74 (mod (+ 77 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse74)) (<= 4294967295 .cse74))) (let ((.cse75 (mod (+ 15 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse75) (not (<= 5000000 .cse75)))) (let ((.cse76 (mod (+ c_main_~x~0 61) 4294967296))) (or (<= 4294967295 .cse76) (not (<= 5000000 .cse76))))) is different from false [2022-04-05 06:06:27,071 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 19 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse0)) (<= 4294967295 .cse0))) (let ((.cse1 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse1)) (<= 4294967295 .cse1))) (let ((.cse2 (mod (+ 40 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse2)) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ c_main_~x~0 75) 4294967296))) (or (not (<= 5000000 .cse3)) (<= 4294967295 .cse3))) (let ((.cse4 (mod (+ 17 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 63 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse5)) (<= 4294967295 .cse5))) (let ((.cse6 (mod (+ 51 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ 52 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse8)) (<= 4294967295 .cse8))) (let ((.cse9 (mod (+ 47 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse9) (not (<= 5000000 .cse9)))) (let ((.cse10 (mod (+ 72 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse10)) (<= 4294967295 .cse10))) (let ((.cse11 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse11)) (<= 4294967295 .cse11))) (let ((.cse12 (mod (+ 58 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse12)) (<= 4294967295 .cse12))) (let ((.cse13 (mod (+ 57 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse13) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse14)) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ 76 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse15)) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse16)) (<= 4294967295 .cse16))) (let ((.cse17 (mod (+ 39 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ 65 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 67 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ c_main_~x~0 50) 4294967296))) (or (<= 4294967295 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse21)) (<= 4294967295 .cse21))) (let ((.cse22 (mod (+ 44 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse22)) (<= 4294967295 .cse22))) (let ((.cse23 (mod (+ 74 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse23)) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ 60 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse24)) (<= 4294967295 .cse24))) (let ((.cse25 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse25)) (<= 4294967295 .cse25))) (let ((.cse26 (mod (+ 53 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse26) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ c_main_~x~0 24) 4294967296))) (or (<= 4294967295 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ 16 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse28) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse29)) (<= 4294967295 .cse29))) (let ((.cse30 (mod (+ 25 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse30)) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ 33 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse31) (not (<= 5000000 .cse31)))) (let ((.cse32 (mod (+ 21 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse32) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ 26 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse34)) (<= 4294967295 .cse34))) (let ((.cse35 (mod (+ c_main_~x~0 54) 4294967296))) (or (<= 4294967295 .cse35) (not (<= 5000000 .cse35)))) (let ((.cse36 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse36)) (<= 4294967295 .cse36))) (let ((.cse37 (mod (+ c_main_~x~0 37) 4294967296))) (or (<= 4294967295 .cse37) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ 73 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse38) (not (<= 5000000 .cse38)))) (let ((.cse39 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse39)) (<= 4294967295 .cse39))) (let ((.cse40 (mod (+ 42 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse40) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ 23 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse41)) (<= 4294967295 .cse41))) (let ((.cse42 (mod (+ c_main_~x~0 27) 4294967296))) (or (not (<= 5000000 .cse42)) (<= 4294967295 .cse42))) (let ((.cse43 (mod (+ 48 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse43) (not (<= 5000000 .cse43)))) (let ((.cse44 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse44)) (<= 4294967295 .cse44))) (let ((.cse45 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse45)) (<= 4294967295 .cse45))) (let ((.cse46 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse46)) (<= 4294967295 .cse46))) (let ((.cse47 (mod (+ 62 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse47)) (<= 4294967295 .cse47))) (let ((.cse48 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse48)) (<= 4294967295 .cse48))) (let ((.cse49 (mod (+ 36 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse49) (not (<= 5000000 .cse49)))) (let ((.cse50 (mod (+ 22 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse50) (not (<= 5000000 .cse50)))) (let ((.cse51 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse51)) (<= 4294967295 .cse51))) (let ((.cse52 (mod (+ 70 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse52) (not (<= 5000000 .cse52)))) (let ((.cse53 (mod (+ 20 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse53) (not (<= 5000000 .cse53)))) (let ((.cse54 (mod (+ 29 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse54) (not (<= 5000000 .cse54)))) (let ((.cse55 (mod (+ 69 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse55) (not (<= 5000000 .cse55)))) (let ((.cse56 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse56)) (<= 4294967295 .cse56))) (let ((.cse57 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse57)) (<= 4294967295 .cse57))) (let ((.cse58 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse58)) (<= 4294967295 .cse58))) (let ((.cse59 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse59)) (<= 4294967295 .cse59))) (let ((.cse60 (mod (+ 77 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse60)) (<= 4294967295 .cse60))) (let ((.cse61 (mod (+ c_main_~x~0 61) 4294967296))) (or (<= 4294967295 .cse61) (not (<= 5000000 .cse61))))) is different from false [2022-04-05 06:06:29,089 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 19 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse0)) (<= 4294967295 .cse0))) (let ((.cse1 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse1)) (<= 4294967295 .cse1))) (let ((.cse2 (mod (+ 40 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse2)) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ c_main_~x~0 75) 4294967296))) (or (not (<= 5000000 .cse3)) (<= 4294967295 .cse3))) (let ((.cse4 (mod (+ 17 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 63 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse5)) (<= 4294967295 .cse5))) (let ((.cse6 (mod (+ 51 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ 52 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse8)) (<= 4294967295 .cse8))) (let ((.cse9 (mod (+ 47 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse9) (not (<= 5000000 .cse9)))) (let ((.cse10 (mod (+ 72 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse10)) (<= 4294967295 .cse10))) (let ((.cse11 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse11)) (<= 4294967295 .cse11))) (let ((.cse12 (mod (+ 58 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse12)) (<= 4294967295 .cse12))) (let ((.cse13 (mod (+ 57 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse13) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse14)) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ 76 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse15)) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse16)) (<= 4294967295 .cse16))) (let ((.cse17 (mod (+ 39 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ 65 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 67 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ c_main_~x~0 50) 4294967296))) (or (<= 4294967295 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse21)) (<= 4294967295 .cse21))) (let ((.cse22 (mod (+ 44 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse22)) (<= 4294967295 .cse22))) (let ((.cse23 (mod (+ 74 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse23)) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ 60 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse24)) (<= 4294967295 .cse24))) (let ((.cse25 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse25)) (<= 4294967295 .cse25))) (let ((.cse26 (mod (+ 53 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse26) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ c_main_~x~0 24) 4294967296))) (or (<= 4294967295 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ 16 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse28) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse29)) (<= 4294967295 .cse29))) (let ((.cse30 (mod (+ 25 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse30)) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ 33 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse31) (not (<= 5000000 .cse31)))) (let ((.cse32 (mod (+ 21 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse32) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ 26 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse34)) (<= 4294967295 .cse34))) (let ((.cse35 (mod (+ c_main_~x~0 54) 4294967296))) (or (<= 4294967295 .cse35) (not (<= 5000000 .cse35)))) (let ((.cse36 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse36)) (<= 4294967295 .cse36))) (let ((.cse37 (mod (+ c_main_~x~0 37) 4294967296))) (or (<= 4294967295 .cse37) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ 73 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse38) (not (<= 5000000 .cse38)))) (let ((.cse39 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse39)) (<= 4294967295 .cse39))) (let ((.cse40 (mod (+ 42 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse40) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ 23 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse41)) (<= 4294967295 .cse41))) (let ((.cse42 (mod (+ c_main_~x~0 27) 4294967296))) (or (not (<= 5000000 .cse42)) (<= 4294967295 .cse42))) (let ((.cse43 (mod (+ 48 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse43) (not (<= 5000000 .cse43)))) (let ((.cse44 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse44)) (<= 4294967295 .cse44))) (let ((.cse45 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse45)) (<= 4294967295 .cse45))) (let ((.cse46 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse46)) (<= 4294967295 .cse46))) (let ((.cse47 (mod (+ 62 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse47)) (<= 4294967295 .cse47))) (let ((.cse48 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse48)) (<= 4294967295 .cse48))) (let ((.cse49 (mod (+ 36 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse49) (not (<= 5000000 .cse49)))) (let ((.cse50 (mod (+ 22 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse50) (not (<= 5000000 .cse50)))) (let ((.cse51 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse51)) (<= 4294967295 .cse51))) (let ((.cse52 (mod (+ 70 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse52) (not (<= 5000000 .cse52)))) (let ((.cse53 (mod (+ 20 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse53) (not (<= 5000000 .cse53)))) (let ((.cse54 (mod (+ 29 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse54) (not (<= 5000000 .cse54)))) (let ((.cse55 (mod (+ 69 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse55) (not (<= 5000000 .cse55)))) (let ((.cse56 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse56)) (<= 4294967295 .cse56))) (let ((.cse57 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse57)) (<= 4294967295 .cse57))) (let ((.cse58 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse58)) (<= 4294967295 .cse58))) (let ((.cse59 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse59)) (<= 4294967295 .cse59))) (let ((.cse60 (mod (+ 15 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse60) (not (<= 5000000 .cse60)))) (let ((.cse61 (mod (+ c_main_~x~0 61) 4294967296))) (or (<= 4294967295 .cse61) (not (<= 5000000 .cse61))))) is different from false [2022-04-05 06:06:31,113 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 19 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse0)) (<= 4294967295 .cse0))) (let ((.cse1 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse1)) (<= 4294967295 .cse1))) (let ((.cse2 (mod (+ 40 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse2)) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ c_main_~x~0 75) 4294967296))) (or (not (<= 5000000 .cse3)) (<= 4294967295 .cse3))) (let ((.cse4 (mod (+ 17 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 63 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse5)) (<= 4294967295 .cse5))) (let ((.cse6 (mod (+ 51 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ 52 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse8)) (<= 4294967295 .cse8))) (let ((.cse9 (mod (+ 47 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse9) (not (<= 5000000 .cse9)))) (let ((.cse10 (mod (+ 72 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse10)) (<= 4294967295 .cse10))) (let ((.cse11 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse11)) (<= 4294967295 .cse11))) (let ((.cse12 (mod (+ 58 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse12)) (<= 4294967295 .cse12))) (let ((.cse13 (mod (+ 57 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse13) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse14)) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ 76 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse15)) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse16)) (<= 4294967295 .cse16))) (let ((.cse17 (mod (+ 39 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ 65 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 67 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ c_main_~x~0 50) 4294967296))) (or (<= 4294967295 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse21)) (<= 4294967295 .cse21))) (let ((.cse22 (mod (+ 44 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse22)) (<= 4294967295 .cse22))) (let ((.cse23 (mod (+ 74 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse23)) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ 60 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse24)) (<= 4294967295 .cse24))) (let ((.cse25 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse25)) (<= 4294967295 .cse25))) (let ((.cse26 (mod (+ 53 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse26) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ c_main_~x~0 24) 4294967296))) (or (<= 4294967295 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ 16 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse28) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse29)) (<= 4294967295 .cse29))) (let ((.cse30 (mod (+ 25 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse30)) (<= 4294967295 .cse30))) (let ((.cse31 (mod (+ 33 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse31) (not (<= 5000000 .cse31)))) (let ((.cse32 (mod (+ 21 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse32) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ 26 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse33) (not (<= 5000000 .cse33)))) (let ((.cse34 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse34)) (<= 4294967295 .cse34))) (let ((.cse35 (mod (+ c_main_~x~0 54) 4294967296))) (or (<= 4294967295 .cse35) (not (<= 5000000 .cse35)))) (let ((.cse36 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse36)) (<= 4294967295 .cse36))) (let ((.cse37 (mod (+ c_main_~x~0 37) 4294967296))) (or (<= 4294967295 .cse37) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ 73 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse38) (not (<= 5000000 .cse38)))) (let ((.cse39 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse39)) (<= 4294967295 .cse39))) (let ((.cse40 (mod (+ 42 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse40) (not (<= 5000000 .cse40)))) (let ((.cse41 (mod (+ 23 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse41)) (<= 4294967295 .cse41))) (let ((.cse42 (mod (+ c_main_~x~0 27) 4294967296))) (or (not (<= 5000000 .cse42)) (<= 4294967295 .cse42))) (let ((.cse43 (mod (+ 48 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse43) (not (<= 5000000 .cse43)))) (let ((.cse44 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse44)) (<= 4294967295 .cse44))) (let ((.cse45 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse45)) (<= 4294967295 .cse45))) (let ((.cse46 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse46)) (<= 4294967295 .cse46))) (let ((.cse47 (mod (+ 62 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse47)) (<= 4294967295 .cse47))) (let ((.cse48 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse48)) (<= 4294967295 .cse48))) (let ((.cse49 (mod (+ 36 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse49) (not (<= 5000000 .cse49)))) (let ((.cse50 (mod (+ 22 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse50) (not (<= 5000000 .cse50)))) (let ((.cse51 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse51)) (<= 4294967295 .cse51))) (let ((.cse52 (mod (+ 70 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse52) (not (<= 5000000 .cse52)))) (let ((.cse53 (mod (+ 20 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse53) (not (<= 5000000 .cse53)))) (let ((.cse54 (mod (+ 29 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse54) (not (<= 5000000 .cse54)))) (let ((.cse55 (mod (+ 69 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse55) (not (<= 5000000 .cse55)))) (let ((.cse56 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse56)) (<= 4294967295 .cse56))) (let ((.cse57 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse57)) (<= 4294967295 .cse57))) (let ((.cse58 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse58)) (<= 4294967295 .cse58))) (let ((.cse59 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse59)) (<= 4294967295 .cse59))) (let ((.cse60 (mod (+ c_main_~x~0 61) 4294967296))) (or (<= 4294967295 .cse60) (not (<= 5000000 .cse60))))) is different from false [2022-04-05 06:06:33,344 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 19 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse0)) (<= 4294967295 .cse0))) (let ((.cse1 (mod (+ 35 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse1)) (<= 4294967295 .cse1))) (let ((.cse2 (mod (+ 40 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse2)) (<= 4294967295 .cse2))) (let ((.cse3 (mod (+ c_main_~x~0 75) 4294967296))) (or (not (<= 5000000 .cse3)) (<= 4294967295 .cse3))) (let ((.cse4 (mod (+ 17 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 63 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse5)) (<= 4294967295 .cse5))) (let ((.cse6 (mod (+ 51 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ 52 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ 59 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse8)) (<= 4294967295 .cse8))) (let ((.cse9 (mod (+ 47 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse9) (not (<= 5000000 .cse9)))) (let ((.cse10 (mod (+ 72 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse10)) (<= 4294967295 .cse10))) (let ((.cse11 (mod (+ 41 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse11)) (<= 4294967295 .cse11))) (let ((.cse12 (mod (+ 58 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse12)) (<= 4294967295 .cse12))) (let ((.cse13 (mod (+ 57 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse13) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ 56 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse14)) (<= 4294967295 .cse14))) (let ((.cse15 (mod (+ 28 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse15)) (<= 4294967295 .cse15))) (let ((.cse16 (mod (+ 39 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ 65 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ 67 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ c_main_~x~0 50) 4294967296))) (or (<= 4294967295 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ 71 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse20)) (<= 4294967295 .cse20))) (let ((.cse21 (mod (+ 44 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse21)) (<= 4294967295 .cse21))) (let ((.cse22 (mod (+ 74 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse22)) (<= 4294967295 .cse22))) (let ((.cse23 (mod (+ 60 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse23)) (<= 4294967295 .cse23))) (let ((.cse24 (mod (+ 34 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse24)) (<= 4294967295 .cse24))) (let ((.cse25 (mod (+ 53 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse25) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ c_main_~x~0 24) 4294967296))) (or (<= 4294967295 .cse26) (not (<= 5000000 .cse26)))) (let ((.cse27 (mod (+ 16 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ 68 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse28)) (<= 4294967295 .cse28))) (let ((.cse29 (mod (+ 25 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse29)) (<= 4294967295 .cse29))) (let ((.cse30 (mod (+ 33 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse30) (not (<= 5000000 .cse30)))) (let ((.cse31 (mod (+ 21 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse31) (not (<= 5000000 .cse31)))) (let ((.cse32 (mod (+ 26 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse32) (not (<= 5000000 .cse32)))) (let ((.cse33 (mod (+ 55 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse33)) (<= 4294967295 .cse33))) (let ((.cse34 (mod (+ c_main_~x~0 54) 4294967296))) (or (<= 4294967295 .cse34) (not (<= 5000000 .cse34)))) (let ((.cse35 (mod (+ 32 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse35)) (<= 4294967295 .cse35))) (let ((.cse36 (mod (+ c_main_~x~0 37) 4294967296))) (or (<= 4294967295 .cse36) (not (<= 5000000 .cse36)))) (let ((.cse37 (mod (+ 73 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse37) (not (<= 5000000 .cse37)))) (let ((.cse38 (mod (+ 64 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse38)) (<= 4294967295 .cse38))) (let ((.cse39 (mod (+ 42 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse39) (not (<= 5000000 .cse39)))) (let ((.cse40 (mod (+ 23 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse40)) (<= 4294967295 .cse40))) (let ((.cse41 (mod (+ c_main_~x~0 27) 4294967296))) (or (not (<= 5000000 .cse41)) (<= 4294967295 .cse41))) (let ((.cse42 (mod (+ 48 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse42) (not (<= 5000000 .cse42)))) (let ((.cse43 (mod (+ 30 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse43)) (<= 4294967295 .cse43))) (let ((.cse44 (mod (+ 18 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse44)) (<= 4294967295 .cse44))) (let ((.cse45 (mod (+ 45 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse45)) (<= 4294967295 .cse45))) (let ((.cse46 (mod (+ 62 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse46)) (<= 4294967295 .cse46))) (let ((.cse47 (mod (+ 49 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse47)) (<= 4294967295 .cse47))) (let ((.cse48 (mod (+ 36 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse48) (not (<= 5000000 .cse48)))) (let ((.cse49 (mod (+ 22 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse49) (not (<= 5000000 .cse49)))) (let ((.cse50 (mod (+ 66 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse50)) (<= 4294967295 .cse50))) (let ((.cse51 (mod (+ 70 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse51) (not (<= 5000000 .cse51)))) (let ((.cse52 (mod (+ 20 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse52) (not (<= 5000000 .cse52)))) (let ((.cse53 (mod (+ 29 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse53) (not (<= 5000000 .cse53)))) (let ((.cse54 (mod (+ 69 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse54) (not (<= 5000000 .cse54)))) (let ((.cse55 (mod (+ 43 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse55)) (<= 4294967295 .cse55))) (let ((.cse56 (mod (+ 38 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse56)) (<= 4294967295 .cse56))) (let ((.cse57 (mod (+ 46 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse57)) (<= 4294967295 .cse57))) (let ((.cse58 (mod (+ 31 c_main_~x~0) 4294967296))) (or (not (<= 5000000 .cse58)) (<= 4294967295 .cse58))) (let ((.cse59 (mod (+ 15 c_main_~x~0) 4294967296))) (or (<= 4294967295 .cse59) (not (<= 5000000 .cse59)))) (let ((.cse60 (mod (+ c_main_~x~0 61) 4294967296))) (or (<= 4294967295 .cse60) (not (<= 5000000 .cse60))))) is different from false