/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain IntervalDomain -i ../sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-03-31 23:05:09,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-31 23:05:09,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-31 23:05:09,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-31 23:05:09,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-31 23:05:09,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-31 23:05:09,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-31 23:05:09,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-31 23:05:09,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-31 23:05:09,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-31 23:05:09,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-31 23:05:09,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-31 23:05:09,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-31 23:05:09,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-31 23:05:09,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-31 23:05:09,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-31 23:05:09,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-31 23:05:09,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-31 23:05:09,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-31 23:05:09,610 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-31 23:05:09,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-31 23:05:09,611 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-31 23:05:09,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-31 23:05:09,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-31 23:05:09,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-31 23:05:09,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-31 23:05:09,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-31 23:05:09,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-31 23:05:09,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-31 23:05:09,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-31 23:05:09,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-31 23:05:09,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-31 23:05:09,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-31 23:05:09,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-31 23:05:09,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-31 23:05:09,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-31 23:05:09,624 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-31 23:05:09,624 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-31 23:05:09,624 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-31 23:05:09,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-31 23:05:09,625 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-31 23:05:09,626 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-03-31 23:05:09,649 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-31 23:05:09,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-31 23:05:09,649 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-31 23:05:09,649 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-31 23:05:09,650 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-31 23:05:09,650 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-31 23:05:09,650 INFO L138 SettingsManager]: * User list type=DISABLED [2023-03-31 23:05:09,650 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-03-31 23:05:09,650 INFO L138 SettingsManager]: * Explicit value domain=true [2023-03-31 23:05:09,651 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-03-31 23:05:09,651 INFO L138 SettingsManager]: * Octagon Domain=false [2023-03-31 23:05:09,651 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-03-31 23:05:09,651 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-03-31 23:05:09,651 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-03-31 23:05:09,651 INFO L138 SettingsManager]: * Interval Domain=false [2023-03-31 23:05:09,652 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-03-31 23:05:09,652 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-03-31 23:05:09,652 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-03-31 23:05:09,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-31 23:05:09,653 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-31 23:05:09,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-31 23:05:09,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-31 23:05:09,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-31 23:05:09,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-31 23:05:09,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-31 23:05:09,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-31 23:05:09,653 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-31 23:05:09,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-31 23:05:09,654 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-31 23:05:09,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-31 23:05:09,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-31 23:05:09,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-31 23:05:09,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 23:05:09,654 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-31 23:05:09,654 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-03-31 23:05:09,654 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-31 23:05:09,654 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-31 23:05:09,654 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-03-31 23:05:09,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-31 23:05:09,655 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-31 23:05:09,655 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-03-31 23:05:09,655 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> IntervalDomain [2023-03-31 23:05:09,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-31 23:05:09,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-31 23:05:09,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-31 23:05:09,880 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-31 23:05:09,880 INFO L275 PluginConnector]: CDTParser initialized [2023-03-31 23:05:09,881 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c [2023-03-31 23:05:11,019 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-31 23:05:11,201 INFO L351 CDTParser]: Found 1 translation units. [2023-03-31 23:05:11,202 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c [2023-03-31 23:05:11,205 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ff54d936/c3de5f67f6cc4802a6d5bc7dcc5cc8ed/FLAGb815f163a [2023-03-31 23:05:11,217 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ff54d936/c3de5f67f6cc4802a6d5bc7dcc5cc8ed [2023-03-31 23:05:11,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-31 23:05:11,220 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-03-31 23:05:11,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-31 23:05:11,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-31 23:05:11,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-31 23:05:11,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 11:05:11" (1/1) ... [2023-03-31 23:05:11,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a3178d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:05:11, skipping insertion in model container [2023-03-31 23:05:11,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 11:05:11" (1/1) ... [2023-03-31 23:05:11,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-31 23:05:11,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-31 23:05:11,416 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c[319,332] [2023-03-31 23:05:11,428 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 23:05:11,436 INFO L203 MainTranslator]: Completed pre-run [2023-03-31 23:05:11,446 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c[319,332] [2023-03-31 23:05:11,449 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 23:05:11,459 INFO L208 MainTranslator]: Completed translation [2023-03-31 23:05:11,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:05:11 WrapperNode [2023-03-31 23:05:11,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-31 23:05:11,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-31 23:05:11,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-31 23:05:11,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-31 23:05:11,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:05:11" (1/1) ... [2023-03-31 23:05:11,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:05:11" (1/1) ... [2023-03-31 23:05:11,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:05:11" (1/1) ... [2023-03-31 23:05:11,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:05:11" (1/1) ... [2023-03-31 23:05:11,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:05:11" (1/1) ... [2023-03-31 23:05:11,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:05:11" (1/1) ... [2023-03-31 23:05:11,484 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:05:11" (1/1) ... [2023-03-31 23:05:11,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:05:11" (1/1) ... [2023-03-31 23:05:11,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-31 23:05:11,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-31 23:05:11,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-31 23:05:11,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-31 23:05:11,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:05:11" (1/1) ... [2023-03-31 23:05:11,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 23:05:11,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 23:05:11,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-03-31 23:05:11,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-03-31 23:05:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-03-31 23:05:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-31 23:05:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-03-31 23:05:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-03-31 23:05:11,552 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-03-31 23:05:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-03-31 23:05:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-03-31 23:05:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-03-31 23:05:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-31 23:05:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-03-31 23:05:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-03-31 23:05:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-03-31 23:05:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-31 23:05:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-31 23:05:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-31 23:05:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-31 23:05:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-31 23:05:11,607 INFO L236 CfgBuilder]: Building ICFG [2023-03-31 23:05:11,609 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-31 23:05:11,681 INFO L277 CfgBuilder]: Performing block encoding [2023-03-31 23:05:11,701 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-31 23:05:11,701 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-03-31 23:05:11,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 11:05:11 BoogieIcfgContainer [2023-03-31 23:05:11,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-31 23:05:11,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-31 23:05:11,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-31 23:05:11,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-31 23:05:11,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.03 11:05:11" (1/3) ... [2023-03-31 23:05:11,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e36687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 11:05:11, skipping insertion in model container [2023-03-31 23:05:11,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 11:05:11" (2/3) ... [2023-03-31 23:05:11,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e36687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 11:05:11, skipping insertion in model container [2023-03-31 23:05:11,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 11:05:11" (3/3) ... [2023-03-31 23:05:11,709 INFO L112 eAbstractionObserver]: Analyzing ICFG mono-crafted_11.c [2023-03-31 23:05:11,721 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-31 23:05:11,722 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-03-31 23:05:11,752 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-31 23:05:11,757 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@691a66e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-03-31 23:05:11,758 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-03-31 23:05:11,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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) [2023-03-31 23:05:11,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-03-31 23:05:11,767 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 23:05:11,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 23:05:11,768 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 23:05:11,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 23:05:11,773 INFO L85 PathProgramCache]: Analyzing trace with hash -320986007, now seen corresponding path program 1 times [2023-03-31 23:05:11,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 23:05:11,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195790916] [2023-03-31 23:05:11,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:05:11,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 23:05:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 23:05:12,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 23:05:12,002 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 23:05:12,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195790916] [2023-03-31 23:05:12,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195790916] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 23:05:12,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 23:05:12,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-03-31 23:05:12,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866762541] [2023-03-31 23:05:12,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 23:05:12,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-31 23:05:12,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 23:05:12,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-31 23:05:12,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-31 23:05:12,032 INFO L87 Difference]: Start difference. First operand has 17 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 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.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 23:05:12,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 23:05:12,104 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2023-03-31 23:05:12,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-31 23:05:12,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 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 10 [2023-03-31 23:05:12,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 23:05:12,110 INFO L225 Difference]: With dead ends: 29 [2023-03-31 23:05:12,110 INFO L226 Difference]: Without dead ends: 12 [2023-03-31 23:05:12,112 INFO L412 NwaCegarLoop]: 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 [2023-03-31 23:05:12,114 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 23:05:12,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 23:05:12,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-03-31 23:05:12,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-03-31 23:05:12,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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) [2023-03-31 23:05:12,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2023-03-31 23:05:12,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2023-03-31 23:05:12,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 23:05:12,152 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2023-03-31 23:05:12,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 23:05:12,152 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2023-03-31 23:05:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-03-31 23:05:12,152 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 23:05:12,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 23:05:12,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-31 23:05:12,153 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 23:05:12,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 23:05:12,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1382352175, now seen corresponding path program 1 times [2023-03-31 23:05:12,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 23:05:12,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231597544] [2023-03-31 23:05:12,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:05:12,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 23:05:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 23:05:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 23:05:12,252 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 23:05:12,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231597544] [2023-03-31 23:05:12,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231597544] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 23:05:12,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539148509] [2023-03-31 23:05:12,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:05:12,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:05:12,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 23:05:12,255 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 23:05:12,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-03-31 23:05:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 23:05:12,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjunts are in the unsatisfiable core [2023-03-31 23:05:12,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 23:05:12,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 23:05:12,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 23:05:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 23:05:12,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539148509] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 23:05:12,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1797655983] [2023-03-31 23:05:12,550 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-03-31 23:05:12,550 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 23:05:12,553 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 23:05:12,557 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 23:05:12,558 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 23:05:12,619 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 8 for LOIs [2023-03-31 23:05:12,650 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 27 for LOIs [2023-03-31 23:05:12,671 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-03-31 23:05:12,677 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 23:05:12,874 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '155#(and (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2023-03-31 23:05:12,876 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 23:05:12,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 23:05:12,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 7] total 10 [2023-03-31 23:05:12,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576196673] [2023-03-31 23:05:12,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 23:05:12,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-03-31 23:05:12,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 23:05:12,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-03-31 23:05:12,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-03-31 23:05:12,878 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 3 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) [2023-03-31 23:05:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 23:05:12,967 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2023-03-31 23:05:12,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-03-31 23:05:12,968 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 3 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 11 [2023-03-31 23:05:12,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 23:05:12,968 INFO L225 Difference]: With dead ends: 24 [2023-03-31 23:05:12,969 INFO L226 Difference]: Without dead ends: 16 [2023-03-31 23:05:12,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2023-03-31 23:05:12,970 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-31 23:05:12,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 28 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-31 23:05:12,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-03-31 23:05:12,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-03-31 23:05:12,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 23:05:12,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2023-03-31 23:05:12,974 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 11 [2023-03-31 23:05:12,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 23:05:12,974 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2023-03-31 23:05:12,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 3 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) [2023-03-31 23:05:12,974 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2023-03-31 23:05:12,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-03-31 23:05:12,974 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 23:05:12,974 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 23:05:12,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-03-31 23:05:13,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:05:13,182 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 23:05:13,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 23:05:13,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1890574545, now seen corresponding path program 2 times [2023-03-31 23:05:13,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 23:05:13,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806215314] [2023-03-31 23:05:13,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:05:13,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 23:05:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 23:05:13,491 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 23:05:13,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 23:05:13,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806215314] [2023-03-31 23:05:13,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806215314] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 23:05:13,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032773939] [2023-03-31 23:05:13,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-03-31 23:05:13,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:05:13,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 23:05:13,493 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 23:05:13,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-03-31 23:05:13,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-03-31 23:05:13,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 23:05:13,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 17 conjunts are in the unsatisfiable core [2023-03-31 23:05:13,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 23:05:13,652 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 23:05:13,652 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 23:05:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 23:05:19,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032773939] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 23:05:19,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [430651328] [2023-03-31 23:05:19,158 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-03-31 23:05:19,158 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 23:05:19,159 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 23:05:19,159 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 23:05:19,159 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 23:05:19,197 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 8 for LOIs [2023-03-31 23:05:19,211 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 27 for LOIs [2023-03-31 23:05:19,221 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-03-31 23:05:19,224 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 23:05:19,863 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '340#(and (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2023-03-31 23:05:19,863 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 23:05:19,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 23:05:19,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 18 [2023-03-31 23:05:19,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305155253] [2023-03-31 23:05:19,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 23:05:19,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-03-31 23:05:19,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 23:05:19,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-03-31 23:05:19,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=528, Unknown=1, NotChecked=0, Total=650 [2023-03-31 23:05:19,865 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 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) [2023-03-31 23:05:30,438 WARN L223 SmtUtils]: Spent 8.01s on a formula simplification. DAG size of input: 83 DAG size of output: 24 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-03-31 23:05:41,361 WARN L223 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 78 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-03-31 23:05:41,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 23:05:41,500 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2023-03-31 23:05:41,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-03-31 23:05:41,501 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 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 15 [2023-03-31 23:05:41,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 23:05:41,501 INFO L225 Difference]: With dead ends: 32 [2023-03-31 23:05:41,501 INFO L226 Difference]: Without dead ends: 24 [2023-03-31 23:05:41,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=241, Invalid=879, Unknown=2, NotChecked=0, Total=1122 [2023-03-31 23:05:41,503 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-03-31 23:05:41,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-03-31 23:05:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-03-31 23:05:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-03-31 23:05:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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) [2023-03-31 23:05:41,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2023-03-31 23:05:41,526 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 15 [2023-03-31 23:05:41,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 23:05:41,526 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2023-03-31 23:05:41,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 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) [2023-03-31 23:05:41,526 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2023-03-31 23:05:41,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-03-31 23:05:41,527 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 23:05:41,527 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 23:05:41,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-03-31 23:05:41,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-03-31 23:05:41,735 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-31 23:05:41,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 23:05:41,735 INFO L85 PathProgramCache]: Analyzing trace with hash 498117841, now seen corresponding path program 3 times [2023-03-31 23:05:41,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-03-31 23:05:41,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878660962] [2023-03-31 23:05:41,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 23:05:41,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 23:05:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 23:05:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 23:05:42,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-03-31 23:05:42,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878660962] [2023-03-31 23:05:42,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878660962] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 23:05:42,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632206104] [2023-03-31 23:05:42,402 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-03-31 23:05:42,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 23:05:42,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 23:05:42,409 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-31 23:05:42,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-03-31 23:05:42,486 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-03-31 23:05:42,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-31 23:05:42,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 34 conjunts are in the unsatisfiable core [2023-03-31 23:05:42,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 23:05:42,708 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 23:05:42,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 23:05:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 23:05:51,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632206104] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 23:05:51,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1788856466] [2023-03-31 23:05:51,672 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-03-31 23:05:51,672 INFO L166 IcfgInterpreter]: Building call graph [2023-03-31 23:05:51,672 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-03-31 23:05:51,672 INFO L176 IcfgInterpreter]: Starting interpretation [2023-03-31 23:05:51,673 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-03-31 23:05:51,683 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 8 for LOIs [2023-03-31 23:05:51,696 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 27 for LOIs [2023-03-31 23:05:51,705 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-03-31 23:05:51,708 INFO L180 IcfgInterpreter]: Interpretation finished [2023-03-31 23:05:52,738 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '633#(and (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2023-03-31 23:05:52,739 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-03-31 23:05:52,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 23:05:52,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 19] total 34 [2023-03-31 23:05:52,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982944250] [2023-03-31 23:05:52,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 23:05:52,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-03-31 23:05:52,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-03-31 23:05:52,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-03-31 23:05:52,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1373, Unknown=0, NotChecked=0, Total=1722 [2023-03-31 23:05:52,741 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 34 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 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) [2023-03-31 23:05:54,850 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse19 (div c_main_~x~0 2))) (let ((.cse15 (+ 4 c_main_~x~0)) (.cse8 (+ 2 c_main_~x~0)) (.cse17 (* .cse19 2))) (let ((.cse6 (+ 7 c_main_~x~0)) (.cse2 (* 4294967296 (div (+ (* .cse19 (- 2)) c_main_~x~0) 4294967296))) (.cse10 (+ 3 c_main_~x~0)) (.cse4 (< c_main_~x~0 (+ .cse17 1))) (.cse0 (* (div .cse8 4294967296) 4294967296)) (.cse5 (mod c_main_~x~0 4294967296)) (.cse12 (* (div .cse15 4294967296) 4294967296)) (.cse1 (= (mod c_main_~x~0 2) 0)) (.cse3 (+ c_main_~x~0 1)) (.cse13 (+ 5 c_main_~x~0)) (.cse9 (* (- 1) c_main_~x~0))) (and (or (< (+ 99999993 .cse0) c_main_~x~0) .cse1 (< (+ (* 4294967296 (div (+ (- 99999992) c_main_~x~0) 4294967296)) 4294967287) c_main_~x~0)) (or (< (+ .cse2 (* (div .cse3 4294967296) 4294967296) 99999987) c_main_~x~0) (< (+ (* (div (+ (- 99999986) c_main_~x~0) 4294967296) 4294967296) 4294967281) c_main_~x~0) .cse4) (or .cse1 (< .cse5 100000000)) (forall ((v_y_95 Int)) (let ((.cse7 (* v_y_95 2))) (or (< (+ 99999981 (* (div (+ (* (- 2) v_y_95) 4 c_main_~x~0) 4294967296) 4294967296) (* (div .cse6 4294967296) 4294967296)) c_main_~x~0) (<= .cse7 .cse8) (< (+ (* (div (+ (- 99999980) c_main_~x~0) 4294967296) 4294967296) (* (div (+ .cse9 4294967275) 4294967296) 4294967296) c_main_~x~0 4294967298) .cse7) (< .cse10 .cse7)))) (or (< (+ (* (div (+ (- 99999974) c_main_~x~0) 4294967296) 4294967296) 4294967289) c_main_~x~0) (forall ((v_y_95 Int)) (let ((.cse11 (* v_y_95 2))) (or (<= .cse11 (+ 8 c_main_~x~0)) (< (+ 9 c_main_~x~0) .cse11) (< (+ 99999975 .cse12 (* 4294967296 (div (+ (* (- 2) v_y_95) 10 c_main_~x~0) 4294967296))) c_main_~x~0))))) (or (< (+ (* 4294967296 (div (+ (- 99999978) c_main_~x~0) 4294967296)) 4294967293) c_main_~x~0) (forall ((v_y_95 Int)) (let ((.cse14 (* v_y_95 2))) (or (< (+ (* 4294967296 (div (+ (* (- 2) v_y_95) 6 c_main_~x~0) 4294967296)) 99999979 .cse0) c_main_~x~0) (< .cse13 .cse14) (<= .cse14 .cse15))))) (or (< (+ (* 4294967296 (div (+ (- 99999976) c_main_~x~0) 4294967296)) 4294967291) c_main_~x~0) (forall ((v_y_95 Int)) (let ((.cse16 (* v_y_95 2))) (or (< (+ 99999977 .cse0 (* (div (+ (* (- 2) v_y_95) 8 c_main_~x~0) 4294967296) 4294967296)) c_main_~x~0) (< .cse6 .cse16) (<= .cse16 (+ 6 c_main_~x~0)))))) (or (< (+ (* (div (+ (- 99999990) c_main_~x~0) 4294967296) 4294967296) 4294967285) c_main_~x~0) (< (+ .cse0 99999991) c_main_~x~0) .cse1) (or (< (+ 99999985 .cse2 (* (div .cse10 4294967296) 4294967296)) c_main_~x~0) (< (+ 4294967294 (* (div (+ .cse9 4294967279) 4294967296) 4294967296) (* (div (+ (- 99999984) c_main_~x~0) 4294967296) 4294967296) c_main_~x~0) .cse17) .cse4) (or (< (+ 4294967291 (* (div (+ (- 99999996) c_main_~x~0) 4294967296) 4294967296)) c_main_~x~0) .cse1 (< (+ 99999997 .cse0) c_main_~x~0)) (or (< (+ (* (div (+ (- 99999998) c_main_~x~0) 4294967296) 4294967296) 4294967293) c_main_~x~0) (<= 100000000 .cse5) .cse1) (or (< (+ 99999995 .cse12) c_main_~x~0) (< (+ (* (div (+ c_main_~x~0 (- 99999994)) 4294967296) 4294967296) 4294967289) c_main_~x~0) .cse1) (or (< (+ .cse12 99999989) c_main_~x~0) (< (+ 4294967283 (* (div (+ c_main_~x~0 (- 99999988)) 4294967296) 4294967296)) c_main_~x~0) .cse1) (forall ((v_y_95 Int)) (let ((.cse18 (* v_y_95 2))) (or (<= .cse18 c_main_~x~0) (< .cse3 .cse18) (< (+ 99999983 (* (div .cse13 4294967296) 4294967296) (* (div (+ (* (- 2) v_y_95) 2 c_main_~x~0) 4294967296) 4294967296)) c_main_~x~0) (< (+ (* (div (+ c_main_~x~0 (- 99999982)) 4294967296) 4294967296) (* (div (+ .cse9 4294967277) 4294967296) 4294967296) 4294967296 c_main_~x~0) .cse18)))))))) is different from false [2023-03-31 23:05:56,869 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse18 (div c_main_~x~0 2))) (let ((.cse13 (+ 4 c_main_~x~0)) (.cse8 (+ 2 c_main_~x~0)) (.cse15 (* .cse18 2))) (let ((.cse6 (+ 7 c_main_~x~0)) (.cse2 (* 4294967296 (div (+ (* .cse18 (- 2)) c_main_~x~0) 4294967296))) (.cse10 (+ 3 c_main_~x~0)) (.cse4 (< c_main_~x~0 (+ .cse15 1))) (.cse0 (* (div .cse8 4294967296) 4294967296)) (.cse5 (mod c_main_~x~0 4294967296)) (.cse16 (* (div .cse13 4294967296) 4294967296)) (.cse1 (= (mod c_main_~x~0 2) 0)) (.cse3 (+ c_main_~x~0 1)) (.cse11 (+ 5 c_main_~x~0)) (.cse9 (* (- 1) c_main_~x~0))) (and (or (< (+ 99999993 .cse0) c_main_~x~0) .cse1 (< (+ (* 4294967296 (div (+ (- 99999992) c_main_~x~0) 4294967296)) 4294967287) c_main_~x~0)) (or (< (+ .cse2 (* (div .cse3 4294967296) 4294967296) 99999987) c_main_~x~0) (< (+ (* (div (+ (- 99999986) c_main_~x~0) 4294967296) 4294967296) 4294967281) c_main_~x~0) .cse4) (or .cse1 (< .cse5 100000000)) (forall ((v_y_95 Int)) (let ((.cse7 (* v_y_95 2))) (or (< (+ 99999981 (* (div (+ (* (- 2) v_y_95) 4 c_main_~x~0) 4294967296) 4294967296) (* (div .cse6 4294967296) 4294967296)) c_main_~x~0) (<= .cse7 .cse8) (< (+ (* (div (+ (- 99999980) c_main_~x~0) 4294967296) 4294967296) (* (div (+ .cse9 4294967275) 4294967296) 4294967296) c_main_~x~0 4294967298) .cse7) (< .cse10 .cse7)))) (or (< (+ (* 4294967296 (div (+ (- 99999978) c_main_~x~0) 4294967296)) 4294967293) c_main_~x~0) (forall ((v_y_95 Int)) (let ((.cse12 (* v_y_95 2))) (or (< (+ (* 4294967296 (div (+ (* (- 2) v_y_95) 6 c_main_~x~0) 4294967296)) 99999979 .cse0) c_main_~x~0) (< .cse11 .cse12) (<= .cse12 .cse13))))) (or (< (+ (* 4294967296 (div (+ (- 99999976) c_main_~x~0) 4294967296)) 4294967291) c_main_~x~0) (forall ((v_y_95 Int)) (let ((.cse14 (* v_y_95 2))) (or (< (+ 99999977 .cse0 (* (div (+ (* (- 2) v_y_95) 8 c_main_~x~0) 4294967296) 4294967296)) c_main_~x~0) (< .cse6 .cse14) (<= .cse14 (+ 6 c_main_~x~0)))))) (or (< (+ (* (div (+ (- 99999990) c_main_~x~0) 4294967296) 4294967296) 4294967285) c_main_~x~0) (< (+ .cse0 99999991) c_main_~x~0) .cse1) (or (< (+ 99999985 .cse2 (* (div .cse10 4294967296) 4294967296)) c_main_~x~0) (< (+ 4294967294 (* (div (+ .cse9 4294967279) 4294967296) 4294967296) (* (div (+ (- 99999984) c_main_~x~0) 4294967296) 4294967296) c_main_~x~0) .cse15) .cse4) (or (< (+ 4294967291 (* (div (+ (- 99999996) c_main_~x~0) 4294967296) 4294967296)) c_main_~x~0) .cse1 (< (+ 99999997 .cse0) c_main_~x~0)) (or (< (+ (* (div (+ (- 99999998) c_main_~x~0) 4294967296) 4294967296) 4294967293) c_main_~x~0) (<= 100000000 .cse5) .cse1) (or (< (+ 99999995 .cse16) c_main_~x~0) (< (+ (* (div (+ c_main_~x~0 (- 99999994)) 4294967296) 4294967296) 4294967289) c_main_~x~0) .cse1) (or (< (+ .cse16 99999989) c_main_~x~0) (< (+ 4294967283 (* (div (+ c_main_~x~0 (- 99999988)) 4294967296) 4294967296)) c_main_~x~0) .cse1) (forall ((v_y_95 Int)) (let ((.cse17 (* v_y_95 2))) (or (<= .cse17 c_main_~x~0) (< .cse3 .cse17) (< (+ 99999983 (* (div .cse11 4294967296) 4294967296) (* (div (+ (* (- 2) v_y_95) 2 c_main_~x~0) 4294967296) 4294967296)) c_main_~x~0) (< (+ (* (div (+ c_main_~x~0 (- 99999982)) 4294967296) 4294967296) (* (div (+ .cse9 4294967277) 4294967296) 4294967296) 4294967296 c_main_~x~0) .cse17)))))))) is different from false [2023-03-31 23:05:58,908 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse16 (div c_main_~x~0 2))) (let ((.cse12 (+ 4 c_main_~x~0)) (.cse7 (+ 2 c_main_~x~0)) (.cse13 (* .cse16 2))) (let ((.cse2 (* 4294967296 (div (+ (* .cse16 (- 2)) c_main_~x~0) 4294967296))) (.cse9 (+ 3 c_main_~x~0)) (.cse4 (< c_main_~x~0 (+ .cse13 1))) (.cse0 (* (div .cse7 4294967296) 4294967296)) (.cse5 (mod c_main_~x~0 4294967296)) (.cse14 (* (div .cse12 4294967296) 4294967296)) (.cse1 (= (mod c_main_~x~0 2) 0)) (.cse3 (+ c_main_~x~0 1)) (.cse10 (+ 5 c_main_~x~0)) (.cse8 (* (- 1) c_main_~x~0))) (and (or (< (+ 99999993 .cse0) c_main_~x~0) .cse1 (< (+ (* 4294967296 (div (+ (- 99999992) c_main_~x~0) 4294967296)) 4294967287) c_main_~x~0)) (or (< (+ .cse2 (* (div .cse3 4294967296) 4294967296) 99999987) c_main_~x~0) (< (+ (* (div (+ (- 99999986) c_main_~x~0) 4294967296) 4294967296) 4294967281) c_main_~x~0) .cse4) (or .cse1 (< .cse5 100000000)) (forall ((v_y_95 Int)) (let ((.cse6 (* v_y_95 2))) (or (< (+ 99999981 (* (div (+ (* (- 2) v_y_95) 4 c_main_~x~0) 4294967296) 4294967296) (* (div (+ 7 c_main_~x~0) 4294967296) 4294967296)) c_main_~x~0) (<= .cse6 .cse7) (< (+ (* (div (+ (- 99999980) c_main_~x~0) 4294967296) 4294967296) (* (div (+ .cse8 4294967275) 4294967296) 4294967296) c_main_~x~0 4294967298) .cse6) (< .cse9 .cse6)))) (or (< (+ (* 4294967296 (div (+ (- 99999978) c_main_~x~0) 4294967296)) 4294967293) c_main_~x~0) (forall ((v_y_95 Int)) (let ((.cse11 (* v_y_95 2))) (or (< (+ (* 4294967296 (div (+ (* (- 2) v_y_95) 6 c_main_~x~0) 4294967296)) 99999979 .cse0) c_main_~x~0) (< .cse10 .cse11) (<= .cse11 .cse12))))) (or (< (+ (* (div (+ (- 99999990) c_main_~x~0) 4294967296) 4294967296) 4294967285) c_main_~x~0) (< (+ .cse0 99999991) c_main_~x~0) .cse1) (or (< (+ 99999985 .cse2 (* (div .cse9 4294967296) 4294967296)) c_main_~x~0) (< (+ 4294967294 (* (div (+ .cse8 4294967279) 4294967296) 4294967296) (* (div (+ (- 99999984) c_main_~x~0) 4294967296) 4294967296) c_main_~x~0) .cse13) .cse4) (or (< (+ 4294967291 (* (div (+ (- 99999996) c_main_~x~0) 4294967296) 4294967296)) c_main_~x~0) .cse1 (< (+ 99999997 .cse0) c_main_~x~0)) (or (< (+ (* (div (+ (- 99999998) c_main_~x~0) 4294967296) 4294967296) 4294967293) c_main_~x~0) (<= 100000000 .cse5) .cse1) (or (< (+ 99999995 .cse14) c_main_~x~0) (< (+ (* (div (+ c_main_~x~0 (- 99999994)) 4294967296) 4294967296) 4294967289) c_main_~x~0) .cse1) (or (< (+ .cse14 99999989) c_main_~x~0) (< (+ 4294967283 (* (div (+ c_main_~x~0 (- 99999988)) 4294967296) 4294967296)) c_main_~x~0) .cse1) (forall ((v_y_95 Int)) (let ((.cse15 (* v_y_95 2))) (or (<= .cse15 c_main_~x~0) (< .cse3 .cse15) (< (+ 99999983 (* (div .cse10 4294967296) 4294967296) (* (div (+ (* (- 2) v_y_95) 2 c_main_~x~0) 4294967296) 4294967296)) c_main_~x~0) (< (+ (* (div (+ c_main_~x~0 (- 99999982)) 4294967296) 4294967296) (* (div (+ .cse8 4294967277) 4294967296) 4294967296) 4294967296 c_main_~x~0) .cse15)))))))) is different from false [2023-03-31 23:06:00,965 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~x~0 2))) (let ((.cse7 (+ 2 c_main_~x~0)) (.cse10 (* .cse13 2))) (let ((.cse2 (* 4294967296 (div (+ (* .cse13 (- 2)) c_main_~x~0) 4294967296))) (.cse9 (+ 3 c_main_~x~0)) (.cse4 (< c_main_~x~0 (+ .cse10 1))) (.cse0 (* (div .cse7 4294967296) 4294967296)) (.cse5 (mod c_main_~x~0 4294967296)) (.cse11 (* (div (+ 4 c_main_~x~0) 4294967296) 4294967296)) (.cse1 (= (mod c_main_~x~0 2) 0)) (.cse3 (+ c_main_~x~0 1)) (.cse8 (* (- 1) c_main_~x~0))) (and (or (< (+ 99999993 .cse0) c_main_~x~0) .cse1 (< (+ (* 4294967296 (div (+ (- 99999992) c_main_~x~0) 4294967296)) 4294967287) c_main_~x~0)) (or (< (+ .cse2 (* (div .cse3 4294967296) 4294967296) 99999987) c_main_~x~0) (< (+ (* (div (+ (- 99999986) c_main_~x~0) 4294967296) 4294967296) 4294967281) c_main_~x~0) .cse4) (or .cse1 (< .cse5 100000000)) (forall ((v_y_95 Int)) (let ((.cse6 (* v_y_95 2))) (or (< (+ 99999981 (* (div (+ (* (- 2) v_y_95) 4 c_main_~x~0) 4294967296) 4294967296) (* (div (+ 7 c_main_~x~0) 4294967296) 4294967296)) c_main_~x~0) (<= .cse6 .cse7) (< (+ (* (div (+ (- 99999980) c_main_~x~0) 4294967296) 4294967296) (* (div (+ .cse8 4294967275) 4294967296) 4294967296) c_main_~x~0 4294967298) .cse6) (< .cse9 .cse6)))) (or (< (+ (* (div (+ (- 99999990) c_main_~x~0) 4294967296) 4294967296) 4294967285) c_main_~x~0) (< (+ .cse0 99999991) c_main_~x~0) .cse1) (or (< (+ 99999985 .cse2 (* (div .cse9 4294967296) 4294967296)) c_main_~x~0) (< (+ 4294967294 (* (div (+ .cse8 4294967279) 4294967296) 4294967296) (* (div (+ (- 99999984) c_main_~x~0) 4294967296) 4294967296) c_main_~x~0) .cse10) .cse4) (or (< (+ 4294967291 (* (div (+ (- 99999996) c_main_~x~0) 4294967296) 4294967296)) c_main_~x~0) .cse1 (< (+ 99999997 .cse0) c_main_~x~0)) (or (< (+ (* (div (+ (- 99999998) c_main_~x~0) 4294967296) 4294967296) 4294967293) c_main_~x~0) (<= 100000000 .cse5) .cse1) (or (< (+ 99999995 .cse11) c_main_~x~0) (< (+ (* (div (+ c_main_~x~0 (- 99999994)) 4294967296) 4294967296) 4294967289) c_main_~x~0) .cse1) (or (< (+ .cse11 99999989) c_main_~x~0) (< (+ 4294967283 (* (div (+ c_main_~x~0 (- 99999988)) 4294967296) 4294967296)) c_main_~x~0) .cse1) (forall ((v_y_95 Int)) (let ((.cse12 (* v_y_95 2))) (or (<= .cse12 c_main_~x~0) (< .cse3 .cse12) (< (+ 99999983 (* (div (+ 5 c_main_~x~0) 4294967296) 4294967296) (* (div (+ (* (- 2) v_y_95) 2 c_main_~x~0) 4294967296) 4294967296)) c_main_~x~0) (< (+ (* (div (+ c_main_~x~0 (- 99999982)) 4294967296) 4294967296) (* (div (+ .cse8 4294967277) 4294967296) 4294967296) 4294967296 c_main_~x~0) .cse12)))))))) is different from false [2023-03-31 23:06:02,975 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (div c_main_~x~0 2))) (let ((.cse7 (* .cse10 2))) (let ((.cse2 (* 4294967296 (div (+ (* .cse10 (- 2)) c_main_~x~0) 4294967296))) (.cse4 (< c_main_~x~0 (+ .cse7 1))) (.cse0 (* (div (+ 2 c_main_~x~0) 4294967296) 4294967296)) (.cse5 (mod c_main_~x~0 4294967296)) (.cse8 (* (div (+ 4 c_main_~x~0) 4294967296) 4294967296)) (.cse1 (= (mod c_main_~x~0 2) 0)) (.cse3 (+ c_main_~x~0 1)) (.cse6 (* (- 1) c_main_~x~0))) (and (or (< (+ 99999993 .cse0) c_main_~x~0) .cse1 (< (+ (* 4294967296 (div (+ (- 99999992) c_main_~x~0) 4294967296)) 4294967287) c_main_~x~0)) (or (< (+ .cse2 (* (div .cse3 4294967296) 4294967296) 99999987) c_main_~x~0) (< (+ (* (div (+ (- 99999986) c_main_~x~0) 4294967296) 4294967296) 4294967281) c_main_~x~0) .cse4) (or .cse1 (< .cse5 100000000)) (or (< (+ (* (div (+ (- 99999990) c_main_~x~0) 4294967296) 4294967296) 4294967285) c_main_~x~0) (< (+ .cse0 99999991) c_main_~x~0) .cse1) (or (< (+ 99999985 .cse2 (* (div (+ 3 c_main_~x~0) 4294967296) 4294967296)) c_main_~x~0) (< (+ 4294967294 (* (div (+ .cse6 4294967279) 4294967296) 4294967296) (* (div (+ (- 99999984) c_main_~x~0) 4294967296) 4294967296) c_main_~x~0) .cse7) .cse4) (or (< (+ 4294967291 (* (div (+ (- 99999996) c_main_~x~0) 4294967296) 4294967296)) c_main_~x~0) .cse1 (< (+ 99999997 .cse0) c_main_~x~0)) (or (< (+ (* (div (+ (- 99999998) c_main_~x~0) 4294967296) 4294967296) 4294967293) c_main_~x~0) (<= 100000000 .cse5) .cse1) (or (< (+ 99999995 .cse8) c_main_~x~0) (< (+ (* (div (+ c_main_~x~0 (- 99999994)) 4294967296) 4294967296) 4294967289) c_main_~x~0) .cse1) (or (< (+ .cse8 99999989) c_main_~x~0) (< (+ 4294967283 (* (div (+ c_main_~x~0 (- 99999988)) 4294967296) 4294967296)) c_main_~x~0) .cse1) (forall ((v_y_95 Int)) (let ((.cse9 (* v_y_95 2))) (or (<= .cse9 c_main_~x~0) (< .cse3 .cse9) (< (+ 99999983 (* (div (+ 5 c_main_~x~0) 4294967296) 4294967296) (* (div (+ (* (- 2) v_y_95) 2 c_main_~x~0) 4294967296) 4294967296)) c_main_~x~0) (< (+ (* (div (+ c_main_~x~0 (- 99999982)) 4294967296) 4294967296) (* (div (+ .cse6 4294967277) 4294967296) 4294967296) 4294967296 c_main_~x~0) .cse9)))))))) is different from false