./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_2_6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_6.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16f616cbb154d125e085ac05764879da22cdfe3693ed1f1a6c28186441fe892d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 20:48:33,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:48:33,529 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:48:33,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:48:33,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:48:33,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:48:33,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:48:33,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:48:33,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:48:33,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:48:33,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:48:33,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:48:33,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:48:33,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:48:33,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:48:33,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:48:33,602 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:48:33,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:48:33,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:48:33,612 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:48:33,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:48:33,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:48:33,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:48:33,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:48:33,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:48:33,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:48:33,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:48:33,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:48:33,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:48:33,634 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:48:33,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:48:33,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:48:33,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:48:33,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:48:33,640 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:48:33,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:48:33,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:48:33,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:48:33,642 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:48:33,643 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:48:33,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:48:33,645 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-20 20:48:33,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:48:33,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:48:33,685 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:48:33,686 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:48:33,687 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:48:33,687 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:48:33,687 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:48:33,688 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:48:33,688 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:48:33,688 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 20:48:33,689 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:48:33,690 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:48:33,690 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 20:48:33,690 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 20:48:33,691 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:48:33,691 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 20:48:33,691 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 20:48:33,692 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 20:48:33,692 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:48:33,693 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 20:48:33,693 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 20:48:33,693 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 20:48:33,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:48:33,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 20:48:33,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:48:33,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 20:48:33,695 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 20:48:33,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 20:48:33,696 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:48:33,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 20:48:33,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:48:33,697 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:48:33,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:48:33,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:48:33,698 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 20:48:33,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:48:33,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 20:48:33,699 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 20:48:33,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 20:48:33,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 20:48:33,700 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:48:33,701 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16f616cbb154d125e085ac05764879da22cdfe3693ed1f1a6c28186441fe892d [2022-11-20 20:48:34,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:48:34,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:48:34,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:48:34,074 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:48:34,075 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:48:34,076 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/combinations/gcd_2+newton_2_6.i [2022-11-20 20:48:37,044 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:48:37,277 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:48:37,278 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i [2022-11-20 20:48:37,285 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/data/db8b390dd/633a70cd032e487fa393232b58d44106/FLAG868f7dd21 [2022-11-20 20:48:37,306 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/data/db8b390dd/633a70cd032e487fa393232b58d44106 [2022-11-20 20:48:37,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:48:37,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:48:37,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:48:37,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:48:37,319 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:48:37,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:48:37" (1/1) ... [2022-11-20 20:48:37,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1998483d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:37, skipping insertion in model container [2022-11-20 20:48:37,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:48:37" (1/1) ... [2022-11-20 20:48:37,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:48:37,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:48:37,567 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i[1226,1239] [2022-11-20 20:48:37,617 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i[2841,2854] [2022-11-20 20:48:37,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:48:37,631 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:48:37,654 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i[1226,1239] [2022-11-20 20:48:37,688 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i[2841,2854] [2022-11-20 20:48:37,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:48:37,709 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:48:37,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:37 WrapperNode [2022-11-20 20:48:37,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:48:37,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:48:37,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:48:37,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:48:37,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:37" (1/1) ... [2022-11-20 20:48:37,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:37" (1/1) ... [2022-11-20 20:48:37,775 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2022-11-20 20:48:37,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:48:37,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:48:37,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:48:37,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:48:37,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:37" (1/1) ... [2022-11-20 20:48:37,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:37" (1/1) ... [2022-11-20 20:48:37,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:37" (1/1) ... [2022-11-20 20:48:37,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:37" (1/1) ... [2022-11-20 20:48:37,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:37" (1/1) ... [2022-11-20 20:48:37,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:37" (1/1) ... [2022-11-20 20:48:37,822 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:37" (1/1) ... [2022-11-20 20:48:37,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:37" (1/1) ... [2022-11-20 20:48:37,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:48:37,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:48:37,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:48:37,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:48:37,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:37" (1/1) ... [2022-11-20 20:48:37,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:48:37,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:48:37,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:48:37,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:48:37,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 20:48:37,930 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-20 20:48:37,930 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-20 20:48:37,930 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-20 20:48:37,930 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-20 20:48:37,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 20:48:37,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:48:37,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:48:38,007 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:48:38,010 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:48:38,207 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:48:38,270 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:48:38,271 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 20:48:38,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:48:38 BoogieIcfgContainer [2022-11-20 20:48:38,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:48:38,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:48:38,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:48:38,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:48:38,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:48:37" (1/3) ... [2022-11-20 20:48:38,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd51c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:48:38, skipping insertion in model container [2022-11-20 20:48:38,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:48:37" (2/3) ... [2022-11-20 20:48:38,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd51c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:48:38, skipping insertion in model container [2022-11-20 20:48:38,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:48:38" (3/3) ... [2022-11-20 20:48:38,286 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_6.i [2022-11-20 20:48:38,310 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:48:38,310 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 20:48:38,367 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:48:38,373 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;@29a077a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:48:38,373 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-20 20:48:38,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 20:48:38,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 20:48:38,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:48:38,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 20:48:38,386 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:48:38,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:48:38,392 INFO L85 PathProgramCache]: Analyzing trace with hash -499021812, now seen corresponding path program 1 times [2022-11-20 20:48:38,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:48:38,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835115838] [2022-11-20 20:48:38,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:48:38,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:48:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:48:38,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:48:38,809 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:48:38,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835115838] [2022-11-20 20:48:38,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835115838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:48:38,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:48:38,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:48:38,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037028772] [2022-11-20 20:48:38,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:48:38,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:48:38,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:48:38,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:48:38,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:48:38,858 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:48:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:48:39,013 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-11-20 20:48:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:48:39,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-20 20:48:39,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:48:39,024 INFO L225 Difference]: With dead ends: 38 [2022-11-20 20:48:39,025 INFO L226 Difference]: Without dead ends: 21 [2022-11-20 20:48:39,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:48:39,035 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:48:39,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 35 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:48:39,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-20 20:48:39,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-20 20:48:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 20:48:39,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-11-20 20:48:39,088 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 6 [2022-11-20 20:48:39,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:48:39,089 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-11-20 20:48:39,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:48:39,090 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-11-20 20:48:39,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 20:48:39,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:48:39,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:48:39,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 20:48:39,093 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:48:39,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:48:39,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1643785969, now seen corresponding path program 1 times [2022-11-20 20:48:39,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:48:39,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158806864] [2022-11-20 20:48:39,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:48:39,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:48:39,125 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:48:39,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1077278283] [2022-11-20 20:48:39,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:48:39,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:48:39,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:48:39,141 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:48:39,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 20:48:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:48:39,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 20:48:39,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:48:39,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:48:39,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:48:39,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:48:39,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:48:39,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158806864] [2022-11-20 20:48:39,952 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:48:39,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077278283] [2022-11-20 20:48:39,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077278283] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:48:39,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [212968570] [2022-11-20 20:48:39,986 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-20 20:48:39,986 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:48:39,990 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:48:39,996 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:48:39,997 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:48:40,276 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:48:40,663 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '160#(and (= |ULTIMATE.start_gcd_test_~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (<= |ULTIMATE.start_gcd_test_#in~a#1| 127) (<= |ULTIMATE.start_main1_~x~0#1| 127) (<= |ULTIMATE.start_gcd_test_#in~b#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (< 0 |ULTIMATE.start_main1_~y~0#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (ite (<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~y~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 (+ |ULTIMATE.start_main1_~x~0#1| 128)) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_#res#1|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-20 20:48:40,663 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:48:40,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:48:40,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-20 20:48:40,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112934310] [2022-11-20 20:48:40,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:48:40,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 20:48:40,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:48:40,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 20:48:40,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-11-20 20:48:40,666 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:48:40,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:48:40,922 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-11-20 20:48:40,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 20:48:40,923 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 20:48:40,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:48:40,924 INFO L225 Difference]: With dead ends: 28 [2022-11-20 20:48:40,924 INFO L226 Difference]: Without dead ends: 23 [2022-11-20 20:48:40,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2022-11-20 20:48:40,926 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:48:40,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 96 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:48:40,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-20 20:48:40,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-20 20:48:40,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 20:48:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-11-20 20:48:40,941 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 7 [2022-11-20 20:48:40,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:48:40,942 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-11-20 20:48:40,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:48:40,942 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-11-20 20:48:40,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 20:48:40,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:48:40,943 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2022-11-20 20:48:40,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 20:48:41,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-20 20:48:41,148 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:48:41,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:48:41,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1300293201, now seen corresponding path program 2 times [2022-11-20 20:48:41,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:48:41,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747426764] [2022-11-20 20:48:41,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:48:41,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:48:41,160 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:48:41,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1727094826] [2022-11-20 20:48:41,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:48:41,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:48:41,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:48:41,162 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:48:41,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 20:48:41,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 20:48:41,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:48:41,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-20 20:48:41,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:48:48,738 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse20 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse11 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256))) (let ((.cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse73 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse74 (mod .cse73 256))) (and (not (<= (mod (+ .cse73 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= .cse11 .cse74) (not (<= .cse74 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0))))))) (.cse31 (not .cse6)) (.cse24 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse72 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse71 (mod .cse72 256))) (and (= .cse11 .cse71) (not (<= .cse71 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (not (<= (mod (+ .cse72 .cse20) 256) 127))))))) (.cse53 (< |c_ULTIMATE.start_main1_~y~0#1| 0)) (.cse3 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse2 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (and (let ((.cse4 (mod .cse2 256))) (let ((.cse5 (<= .cse4 127))) (or (and (let ((.cse0 (+ .cse4 (- 256)))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse0) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse0))) (and (not (= .cse1 0)) (= (mod (+ .cse1 .cse2) 256) .cse3) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (not .cse5) (or (and .cse6 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse7 (mod .cse8 256))) (and (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse7) (<= (mod (+ .cse8 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= .cse7 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse9 256)) (= .cse9 0) (<= (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~a#1|) 256) .cse11) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (not (= .cse10 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0) (<= (mod .cse10 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod (+ .cse12 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse12 256)) (= .cse12 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse14 (mod .cse13 256))) (and (not (<= (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse14) (<= .cse14 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse15 (mod .cse16 256))) (and (= .cse11 .cse15) (not (<= .cse15 127)) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= (mod (+ .cse16 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127))))) .cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod .cse18 256) 127)) (= (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~a#1|) 256) .cse11) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= (mod (+ .cse19 .cse20) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse19 256)) (= .cse19 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse21 (mod .cse22 256))) (and (= .cse11 .cse21) (not (<= .cse21 127)) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= (mod (+ .cse22 .cse20) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse23 256)) (= .cse23 0) (not (<= (mod (+ .cse23 .cse20) 256) 127))))) .cse24 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= (mod (+ .cse25 .cse20) 256) .cse11) (not (= .cse25 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0) (<= (mod .cse25 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod .cse26 256) 127)) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= (mod (+ .cse26 .cse20) 256) .cse11) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse27 (mod .cse28 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse27) (not (<= (mod (+ .cse28 .cse20) 256) 127)) (<= .cse27 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse30 (mod .cse29 256))) (and (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= (mod (+ .cse29 .cse20) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse30) (<= .cse30 127)))))) .cse31))) (and (not (= .cse4 0)) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse32 256)) (= .cse32 0) (not (<= (mod (+ .cse32 .cse20) 256) 127)) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ .cse33 .cse20) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse33 256)) (= .cse33 0) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse34 (mod .cse35 256))) (and (= .cse11 .cse34) (not (<= .cse34 127)) (not (<= (mod (+ .cse35 .cse20) 256) 127)) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse37 (mod .cse36 256))) (and (<= (mod (+ .cse36 .cse20) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse37) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse37 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse38 (mod .cse39 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse38) (not (<= (mod (+ .cse39 .cse20) 256) 127)) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse38 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse40 (mod .cse41 256))) (and (= .cse11 .cse40) (not (<= .cse40 127)) (<= (mod (+ .cse41 .cse20) 256) 127) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) .cse31) (and .cse6 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse42 (mod .cse43 256))) (and (= .cse11 .cse42) (not (<= .cse42 127)) (<= (mod (+ .cse43 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse44 256)) (= .cse44 0) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse45 (mod .cse46 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse45) (<= (mod (+ .cse46 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse45 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse48 (mod .cse47 256))) (and (not (<= (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse48) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse48 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse50 (mod .cse49 256))) (and (not (<= (mod (+ .cse49 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= .cse11 .cse50) (not (<= .cse50 127)) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse51 256)) (= .cse51 0) (<= (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4) 256)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (and (= .cse3 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse52) 256)) (not (= .cse52 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) .cse5)))) .cse53) (and (or (and .cse6 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse54 (mod .cse55 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse54) (<= (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse54 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse57 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse56 (mod .cse57 256))) (and (= .cse11 .cse56) (not (<= .cse56 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (<= (mod (+ .cse57 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse58 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse59 (mod .cse58 256))) (and (not (<= (mod (+ .cse58 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse59) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse59 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse60 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod (+ .cse60 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse60 256)) (= .cse60 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|)))) .cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse61 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse61 256)) (= .cse61 0) (<= (mod (+ .cse61 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) (and .cse31 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse62 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ .cse62 .cse20) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse62 256)) (= .cse62 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse64 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse63 (mod .cse64 256))) (and (= .cse11 .cse63) (not (<= .cse63 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (<= (mod (+ .cse64 .cse20) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse65 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse66 (mod .cse65 256))) (and (<= (mod (+ .cse65 .cse20) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse66) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse66 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse68 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse67 (mod .cse68 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse67) (not (<= (mod (+ .cse68 .cse20) 256) 127)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse67 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse69 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse69 256)) (= .cse69 0) (not (<= (mod (+ .cse69 .cse20) 256) 127)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|)))) .cse24))) (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (not .cse53) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse70 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= .cse3 (mod (+ .cse70 .cse2) 256)) (not (= .cse70 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))))))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-20 20:49:42,957 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (let ((.cse10 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (let ((.cse6 (mod .cse10 256))) (let ((.cse24 (<= .cse6 127)) (.cse13 (< |c_ULTIMATE.start_main1_~y~0#1| 0)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse16 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse33 (not .cse0)) (.cse19 (not (= .cse6 0))) (.cse28 (not (= |c_ULTIMATE.start_main1_~y~0#1| 0))) (.cse32 (not .cse13)) (.cse3 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse7 (+ .cse6 (- 256))) (.cse14 (not .cse24))) (or (and .cse0 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse2 (mod .cse4 256))) (let ((.cse1 (mod .cse2 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse1 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse1 256)) (not (= .cse2 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse2))) (and (= .cse3 (mod (+ (* .cse4 255) .cse5) 256)) (not (= .cse5 0)) (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse11 (+ (mod (+ .cse9 .cse10) 256) (- 256)))) (let ((.cse12 (mod .cse11 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse11))) (and (not (= .cse8 0)) (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= .cse3 (mod (+ .cse9 .cse10 .cse8) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (= (mod .cse12 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse9 0)) (= .cse12 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))))) .cse13 .cse14) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse18 (+ (mod (+ .cse17 .cse10) 256) (- 256)))) (let ((.cse15 (mod .cse18 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~a#1|) 256) .cse16) (not (= .cse17 0)) (not (= .cse15 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= .cse3 (mod (+ .cse17 .cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse18)) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0))) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse13 .cse14) (and (let ((.cse22 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (and .cse13 (or (and .cse19 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse20 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse23) 256)))) (let ((.cse21 (mod .cse20 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse20) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= (mod (+ .cse21 .cse22) 256) .cse16) (not (= .cse21 0)) (not (= .cse23 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse24) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse27 (+ (mod (+ .cse26 .cse10) 256) (- 256)))) (let ((.cse25 (mod .cse27 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse16 (mod (+ .cse25 .cse22) 256)) (not (= .cse26 0)) (not (= .cse25 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse27) 256) |c_ULTIMATE.start_gcd_test_~a#1|))) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse14))) (and .cse28 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse31 (+ (- 256) (mod (+ .cse30 .cse10) 256)))) (let ((.cse29 (mod .cse31 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse16 (mod (+ .cse22 .cse29) 256)) (not (= .cse29 0)) (not (= .cse30 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse31) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse32))) .cse33) (and (or (and .cse28 .cse32 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse34) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse34 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse34 0)))))) (and (or (and .cse14 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse35 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse35) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse35 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse35 0)))))) (and .cse19 .cse24 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6) 256))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse36) 256)) (= (mod (mod .cse36 |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse36 0)) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) .cse13)) .cse33) (and .cse33 (or (and .cse13 (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse39 (+ (mod (+ .cse38 .cse10) 256) (- 256)))) (let ((.cse37 (mod .cse39 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod .cse37 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse38 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse39) 256) |c_ULTIMATE.start_gcd_test_~a#1|))) (= .cse37 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse41 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7) 256))) (let ((.cse40 (mod .cse41 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse40 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse41) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse40 256)) (not (= .cse41 0))))))) .cse14) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse42 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse44) 256)))) (let ((.cse43 (mod .cse42 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse42) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= .cse43 0) (not (= .cse44 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse43 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse45 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6) 256))) (let ((.cse46 (mod .cse45 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse45) 256)) (= (mod .cse46 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse45 0)) (= .cse46 0) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) .cse19 .cse24))) (and .cse28 .cse32 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse47 (+ (- 256) (mod (+ .cse49 .cse10) 256)))) (let ((.cse48 (mod .cse47 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse47) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (= .cse48 0) (not (= .cse49 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse48 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse50 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse51 (mod .cse50 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse50) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse51 256)) (= .cse51 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse50 0)))))))))) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse52 (mod .cse53 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse52 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse52 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse54 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse52))) (and (= .cse3 (mod (+ (* .cse53 255) .cse54) 256)) (not (= .cse54 0)) (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))))))) .cse13 .cse14)))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-20 20:49:48,202 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse3 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (let ((.cse1 (mod .cse3 256))) (let ((.cse10 (< |c_ULTIMATE.start_main1_~y~0#1| 0)) (.cse19 (<= .cse1 127)) (.cse12 (< |c_ULTIMATE.start_main1_~g~0#1| 0))) (let ((.cse4 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse26 (not .cse12)) (.cse18 (not (= .cse1 0))) (.cse6 (+ .cse1 (- 256))) (.cse11 (not .cse19)) (.cse13 (not (= |c_ULTIMATE.start_main1_~y~0#1| 0))) (.cse14 (not .cse10)) (.cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (= (mod (mod .cse32 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse32) 256) |c_ULTIMATE.start_main1_~g~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse32 0))))))) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse5 (+ (mod (+ .cse2 .cse3) 256) (- 256)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse5))) (and (not (= .cse0 0)) (<= .cse1 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= (mod (+ .cse2 .cse3 .cse0) 256) .cse4) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (= (mod .cse5 |c_ULTIMATE.start_main1_~g~0#1|) 0) (not (= .cse2 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse9 (mod .cse7 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse9))) (and (= .cse4 (mod (+ (* .cse7 255) .cse8) 256)) (not (= .cse8 0)) (<= .cse1 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (= (mod .cse9 |c_ULTIMATE.start_main1_~g~0#1|) 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse9 0))))))) .cse10 .cse11 .cse12) (and (or (and .cse13 .cse14 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse15 (+ (- 256) (mod (+ .cse16 .cse3) 256)))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse15) 256) |c_ULTIMATE.start_main1_~g~0#1|) (not (= .cse16 0)) (= (mod (mod .cse15 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) .cse17)) (and (or (and .cse18 .cse19 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse20 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse1) 256))) (and (= (mod .cse20 |c_ULTIMATE.start_main1_~g~0#1|) 0) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse20) 256) |c_ULTIMATE.start_main1_~g~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse20 0)) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse1))) (let ((.cse21 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse22) 256)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse21) 256) |c_ULTIMATE.start_main1_~g~0#1|) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (not (= .cse22 0)) (= (mod .cse21 |c_ULTIMATE.start_main1_~g~0#1|) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6) 256))) (and (= (mod .cse23 |c_ULTIMATE.start_main1_~g~0#1|) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse23) 256) |c_ULTIMATE.start_main1_~g~0#1|))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse23 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse25 (+ (mod (+ .cse24 .cse3) 256) (- 256)))) (and (not (= .cse24 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse25) 256) |c_ULTIMATE.start_main1_~g~0#1|))) (= (mod (mod .cse25 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse11)) .cse10)) .cse26) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse29 (mod .cse27 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse29))) (and (= .cse4 (mod (+ (* .cse27 255) .cse28) 256)) (not (= .cse28 0)) (<= .cse1 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse29 0)) (= (mod (mod .cse29 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0))))) .cse10 .cse11 .cse12) (and .cse26 (or (and .cse10 (or (and .cse18 .cse19 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse30 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse1) 256))) (and (= (mod (mod .cse30 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse30) 256) |c_ULTIMATE.start_main1_~g~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse30 0)) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse31 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse31) 256) |c_ULTIMATE.start_main1_~g~0#1|))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse31 0)) (= (mod (mod .cse31 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0)))) .cse11))) (and .cse13 .cse14 .cse17)))))))) (not (= |c_ULTIMATE.start_main1_~g~0#1| 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| 127)) is different from false [2022-11-20 20:49:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-20 20:49:49,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:52:18,765 WARN L233 SmtUtils]: Spent 2.13m on a formula simplification. DAG size of input: 80 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:56:29,620 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse23 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (let ((.cse0 (not .cse23)) (.cse4 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse3 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse2 (mod (+ .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse1 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse2) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse1 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse2 127)) (<= (mod (+ .cse3 .cse4) 256) 127) (<= (mod .cse3 256) 127) (= 0 .cse2) (not (= (mod (mod .cse2 .cse1) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse7 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (mod .cse7 256))) (let ((.cse5 (+ (- 256) .cse8))) (let ((.cse6 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse5) 256))) (or (not (= (mod (mod .cse5 .cse6) 256) 0)) (not (<= (mod (+ .cse7 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse7 .cse4) 256) 127) (<= .cse8 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse6 |c_ULTIMATE.start_main1_~y~0#1|))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse9 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod .cse9 256))) (let ((.cse10 (+ (- 256) .cse12))) (let ((.cse11 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse10) 256))) (or (not (<= (mod (+ .cse9 .cse4) 256) 127)) (not (= (mod (mod .cse10 .cse11) 256) 0)) (<= .cse12 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse11 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse15 (+ (- 256) .cse16))) (let ((.cse14 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse15) 256))) (or (not (<= (mod (+ .cse13 .cse4) 256) 127)) (<= .cse14 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse15 .cse14) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse13 256) 127) (<= .cse16 127)))))))))) .cse0) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse17 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (mod .cse17 256))) (let ((.cse19 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse18) 256))) (or (not (<= (mod (+ .cse17 .cse4) 256) 127)) (= .cse18 0) (not (<= (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse19 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse18 127)) (not (= (mod (mod .cse18 .cse19) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse20 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse21 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse22) 256))) (or (not (<= (mod (+ .cse20 .cse4) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse21 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse22 127)) (= 0 .cse22) (not (<= (mod .cse20 256) 127)) (not (= (mod (mod .cse22 .cse21) 256) 0))))))))))) (or .cse23 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse26 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod (+ .cse26 .cse4) 256))) (let ((.cse24 (+ (- 256) .cse27))) (let ((.cse25 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse24) 256))) (or (not (= (mod (mod .cse24 .cse25) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse27 127) (<= .cse25 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse26 256) 127)) (= .cse26 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod .cse29 256))) (let ((.cse30 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse28) 256))) (or (= .cse28 0) (not (<= (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse29 .cse4) 256) 127) (<= .cse30 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse28 127)) (not (= (mod (mod .cse28 .cse30) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse32 (mod .cse31 256))) (let ((.cse33 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse32) 256))) (or (not (<= (mod (+ .cse31 .cse4) 256) 127)) (= .cse32 0) (<= .cse33 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse32 127)) (not (= (mod (mod .cse32 .cse33) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse34 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse37 (mod (+ .cse34 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse36 (+ (- 256) .cse37))) (let ((.cse35 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse36) 256))) (or (not (<= (mod (+ .cse34 .cse4) 256) 127)) (<= .cse35 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse36 .cse35) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod .cse34 256) 127)) (<= .cse37 127) (= .cse34 0)))))))))) .cse0) (or .cse23 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse40 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse41 (mod .cse40 256))) (let ((.cse38 (+ (- 256) .cse41))) (let ((.cse39 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse38) 256))) (or (not (= (mod (mod .cse38 .cse39) 256) 0)) (not (<= (mod (+ .cse40 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse40 .cse4) 256) 127) (<= .cse41 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse39 |c_ULTIMATE.start_main1_~y~0#1|))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse44 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse45 (mod (+ .cse44 .cse4) 256))) (let ((.cse42 (+ (- 256) .cse45))) (let ((.cse43 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse42) 256))) (or (not (= (mod (mod .cse42 .cse43) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse45 127) (<= (mod .cse44 256) 127) (<= .cse43 |c_ULTIMATE.start_main1_~y~0#1|))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse23 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod (+ .cse47 .cse4) 256))) (let ((.cse48 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse46) 256))) (or (not (<= .cse46 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse46 0) (<= (mod .cse47 256) 127) (<= (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= .cse48 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse46 .cse48) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse49 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse52 (mod .cse49 256))) (let ((.cse50 (+ (- 256) .cse52))) (let ((.cse51 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse50) 256))) (or (not (<= (mod (+ .cse49 .cse4) 256) 127)) (not (= (mod (mod .cse50 .cse51) 256) 0)) (<= .cse52 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse51 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse49 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))))) (or .cse23 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse56 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse55 (mod (+ .cse56 .cse4) 256))) (let ((.cse53 (+ (- 256) .cse55))) (let ((.cse54 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse53) 256))) (or (not (= (mod (mod .cse53 .cse54) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse55 127) (<= (mod .cse56 256) 127) (<= .cse54 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse56 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse59 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse60 (mod .cse59 256))) (let ((.cse57 (+ (- 256) .cse60))) (let ((.cse58 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse57) 256))) (or (not (= (mod (mod .cse57 .cse58) 256) 0)) (<= (mod (+ .cse59 .cse4) 256) 127) (<= .cse60 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse58 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse59 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse61 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse64 (mod .cse61 256))) (let ((.cse62 (+ (- 256) .cse64))) (let ((.cse63 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse62) 256))) (or (not (<= (mod (+ .cse61 .cse4) 256) 127)) (not (= (mod (mod .cse62 .cse63) 256) 0)) (not (<= (mod (+ .cse61 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse64 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse63 |c_ULTIMATE.start_main1_~y~0#1|))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse66 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse65 (mod (+ .cse66 .cse4) 256))) (let ((.cse67 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse65) 256))) (or (not (<= .cse65 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse66 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse65 0) (<= (mod .cse66 256) 127) (<= .cse67 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse65 .cse67) 256) 0)))))))))) .cse23) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse70 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse71 (mod (+ .cse70 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse69 (+ (- 256) .cse71))) (let ((.cse68 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse69) 256))) (or (<= .cse68 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse69 .cse68) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse70 .cse4) 256) 127) (<= (mod .cse70 256) 127) (<= .cse71 127))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse74 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse75 (mod .cse74 256))) (let ((.cse72 (+ (- 256) .cse75))) (let ((.cse73 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse72) 256))) (or (not (= (mod (mod .cse72 .cse73) 256) 0)) (<= (mod (+ .cse74 .cse4) 256) 127) (<= .cse75 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse73 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse74 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse77 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse76 (mod (+ .cse77 .cse4) 256))) (let ((.cse78 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse76) 256))) (or (not (<= .cse76 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse76 0) (not (<= (mod .cse77 256) 127)) (<= (mod (+ .cse77 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= .cse78 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse76 .cse78) 256) 0)) (= .cse77 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse79 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse80 (mod .cse79 256))) (let ((.cse81 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse80) 256))) (or (not (<= (mod (+ .cse79 .cse4) 256) 127)) (= .cse80 0) (<= .cse81 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse80 127)) (not (= (mod (mod .cse80 .cse81) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse79 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse23) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse82 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse84 (mod (+ .cse82 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse83 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse84) 256))) (or (not (<= (mod (+ .cse82 .cse4) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse83 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse84 127)) (<= (mod .cse82 256) 127) (= 0 .cse84) (not (= (mod (mod .cse84 .cse83) 256) 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse85 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse88 (mod .cse85 256))) (let ((.cse86 (+ (- 256) .cse88))) (let ((.cse87 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse86) 256))) (or (not (<= (mod (+ .cse85 .cse4) 256) 127)) (not (= (mod (mod .cse86 .cse87) 256) 0)) (not (<= (mod (+ .cse85 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse88 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse87 |c_ULTIMATE.start_main1_~y~0#1|))))))))))) (or .cse23 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse90 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse89 (mod (+ .cse90 .cse4) 256))) (let ((.cse91 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse89) 256))) (or (not (<= .cse89 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse90 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse89 0) (not (<= (mod .cse90 256) 127)) (<= .cse91 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse89 .cse91) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse92 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse93 (mod .cse92 256))) (let ((.cse94 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse93) 256))) (or (not (<= (mod (+ .cse92 .cse4) 256) 127)) (= .cse93 0) (not (<= (mod (+ .cse92 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse94 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse93 127)) (not (= (mod (mod .cse93 .cse94) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse97 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse96 (mod (+ .cse97 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse95 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse96) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse95 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse96 127)) (<= (mod (+ .cse97 .cse4) 256) 127) (= 0 .cse96) (not (<= (mod .cse97 256) 127)) (not (= (mod (mod .cse96 .cse95) 256) 0)) (= .cse97 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse99 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse98 (mod .cse99 256))) (let ((.cse100 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse98) 256))) (or (= .cse98 0) (not (<= (mod (+ .cse99 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse99 .cse4) 256) 127) (<= .cse100 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse98 127)) (not (= (mod (mod .cse98 .cse100) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse104 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse103 (mod (+ .cse104 .cse4) 256))) (let ((.cse101 (+ (- 256) .cse103))) (let ((.cse102 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse101) 256))) (or (not (= (mod (mod .cse101 .cse102) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse103 127) (<= .cse102 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse104 256) 127)) (<= (mod (+ .cse104 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse104 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse106 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse105 (mod .cse106 256))) (let ((.cse107 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse105) 256))) (or (= .cse105 0) (<= (mod (+ .cse106 .cse4) 256) 127) (<= .cse107 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse105 127)) (not (= (mod (mod .cse105 .cse107) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse106 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))) .cse23) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse110 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse111 (mod (+ .cse110 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse109 (+ (- 256) .cse111))) (let ((.cse108 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse109) 256))) (or (<= .cse108 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse109 .cse108) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse110 .cse4) 256) 127) (not (<= (mod .cse110 256) 127)) (<= .cse111 127) (= .cse110 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse113 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse112 (mod .cse113 256))) (let ((.cse114 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse112) 256))) (or (= .cse112 0) (<= (mod (+ .cse113 .cse4) 256) 127) (<= .cse114 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse112 127)) (not (= (mod (mod .cse112 .cse114) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse113 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) is different from true [2022-11-20 20:56:30,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 20:56:30,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:56:30,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747426764] [2022-11-20 20:56:30,307 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:56:30,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727094826] [2022-11-20 20:56:30,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727094826] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:56:30,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1669033210] [2022-11-20 20:56:30,311 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-20 20:56:30,312 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:56:30,312 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:56:30,312 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:56:30,312 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:56:30,409 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:56:33,839 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '306#(and (= |ULTIMATE.start_gcd_test_~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (<= |ULTIMATE.start_gcd_test_#in~a#1| 127) (<= |ULTIMATE.start_main1_~x~0#1| 127) (<= |ULTIMATE.start_gcd_test_#in~b#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (< 0 |ULTIMATE.start_main1_~y~0#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (ite (<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~y~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 (+ |ULTIMATE.start_main1_~x~0#1| 128)) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_#res#1|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-20 20:56:33,839 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:56:33,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:56:33,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-20 20:56:33,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234582866] [2022-11-20 20:56:33,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:56:33,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 20:56:33,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:56:33,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 20:56:33,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=167, Unknown=5, NotChecked=116, Total=342 [2022-11-20 20:56:33,841 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:35,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-20 20:56:37,954 WARN L859 $PredicateComparison]: unable to prove that (and (let ((.cse0 (< |c_ULTIMATE.start_main1_~y~0#1| 0))) (or (and .cse0 (let ((.cse1 (mod (* |c_ULTIMATE.start_main1_~y~0#1| 255) 256))) (let ((.cse2 (<= .cse1 127))) (or (and (= .cse1 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (not .cse2)) (and (= .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) .cse2))))) (and (not .cse0) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|)))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (let ((.cse26 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (let ((.cse3 (not .cse26)) (.cse7 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or .cse3 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse6 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse5 (mod (+ .cse6 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse4 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse5) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse5 127)) (<= (mod (+ .cse6 .cse7) 256) 127) (<= (mod .cse6 256) 127) (= 0 .cse5) (not (= (mod (mod .cse5 .cse4) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse10 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse11 (mod .cse10 256))) (let ((.cse8 (+ (- 256) .cse11))) (let ((.cse9 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse8) 256))) (or (not (= (mod (mod .cse8 .cse9) 256) 0)) (not (<= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse10 .cse7) 256) 127) (<= .cse11 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse9 |c_ULTIMATE.start_main1_~y~0#1|))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse12 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse15 (mod .cse12 256))) (let ((.cse13 (+ (- 256) .cse15))) (let ((.cse14 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse13) 256))) (or (not (<= (mod (+ .cse12 .cse7) 256) 127)) (not (= (mod (mod .cse13 .cse14) 256) 0)) (<= .cse15 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse14 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse12 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse16 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse19 (mod (+ .cse16 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse18 (+ (- 256) .cse19))) (let ((.cse17 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse18) 256))) (or (not (<= (mod (+ .cse16 .cse7) 256) 127)) (<= .cse17 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse18 .cse17) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse16 256) 127) (<= .cse19 127)))))))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse20 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse21 (mod .cse20 256))) (let ((.cse22 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse21) 256))) (or (not (<= (mod (+ .cse20 .cse7) 256) 127)) (= .cse21 0) (not (<= (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse22 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse21 127)) (not (= (mod (mod .cse21 .cse22) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse23 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse24 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse25) 256))) (or (not (<= (mod (+ .cse23 .cse7) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse24 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse25 127)) (= 0 .cse25) (not (<= (mod .cse23 256) 127)) (not (= (mod (mod .cse25 .cse24) 256) 0))))))))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod (+ .cse29 .cse7) 256))) (let ((.cse27 (+ (- 256) .cse30))) (let ((.cse28 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse27) 256))) (or (not (= (mod (mod .cse27 .cse28) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse30 127) (<= .cse28 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse29 256) 127)) (= .cse29 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse32 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod .cse32 256))) (let ((.cse33 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse31) 256))) (or (= .cse31 0) (not (<= (mod (+ .cse32 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse32 .cse7) 256) 127) (<= .cse33 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse31 127)) (not (= (mod (mod .cse31 .cse33) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse34 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse35 (mod .cse34 256))) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse35) 256))) (or (not (<= (mod (+ .cse34 .cse7) 256) 127)) (= .cse35 0) (<= .cse36 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse35 127)) (not (= (mod (mod .cse35 .cse36) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse34 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse37 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse40 (mod (+ .cse37 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse39 (+ (- 256) .cse40))) (let ((.cse38 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse39) 256))) (or (not (<= (mod (+ .cse37 .cse7) 256) 127)) (<= .cse38 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse39 .cse38) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod .cse37 256) 127)) (<= .cse40 127) (= .cse37 0)))))))))) .cse3) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse43 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse44 (mod .cse43 256))) (let ((.cse41 (+ (- 256) .cse44))) (let ((.cse42 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse41) 256))) (or (not (= (mod (mod .cse41 .cse42) 256) 0)) (not (<= (mod (+ .cse43 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse43 .cse7) 256) 127) (<= .cse44 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse42 |c_ULTIMATE.start_main1_~y~0#1|))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse48 (mod (+ .cse47 .cse7) 256))) (let ((.cse45 (+ (- 256) .cse48))) (let ((.cse46 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse45) 256))) (or (not (= (mod (mod .cse45 .cse46) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse48 127) (<= (mod .cse47 256) 127) (<= .cse46 |c_ULTIMATE.start_main1_~y~0#1|))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse50 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse49 (mod (+ .cse50 .cse7) 256))) (let ((.cse51 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse49) 256))) (or (not (<= .cse49 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse49 0) (<= (mod .cse50 256) 127) (<= (mod (+ .cse50 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= .cse51 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse49 .cse51) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse52 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse55 (mod .cse52 256))) (let ((.cse53 (+ (- 256) .cse55))) (let ((.cse54 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse53) 256))) (or (not (<= (mod (+ .cse52 .cse7) 256) 127)) (not (= (mod (mod .cse53 .cse54) 256) 0)) (<= .cse55 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse54 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse52 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse59 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse58 (mod (+ .cse59 .cse7) 256))) (let ((.cse56 (+ (- 256) .cse58))) (let ((.cse57 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse56) 256))) (or (not (= (mod (mod .cse56 .cse57) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse58 127) (<= (mod .cse59 256) 127) (<= .cse57 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse59 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse62 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse63 (mod .cse62 256))) (let ((.cse60 (+ (- 256) .cse63))) (let ((.cse61 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse60) 256))) (or (not (= (mod (mod .cse60 .cse61) 256) 0)) (<= (mod (+ .cse62 .cse7) 256) 127) (<= .cse63 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse61 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse64 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse67 (mod .cse64 256))) (let ((.cse65 (+ (- 256) .cse67))) (let ((.cse66 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse65) 256))) (or (not (<= (mod (+ .cse64 .cse7) 256) 127)) (not (= (mod (mod .cse65 .cse66) 256) 0)) (not (<= (mod (+ .cse64 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse67 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse66 |c_ULTIMATE.start_main1_~y~0#1|))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse69 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse68 (mod (+ .cse69 .cse7) 256))) (let ((.cse70 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse68) 256))) (or (not (<= .cse68 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse69 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse68 0) (<= (mod .cse69 256) 127) (<= .cse70 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse68 .cse70) 256) 0)))))))))) .cse26) (or .cse3 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse73 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse74 (mod (+ .cse73 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse72 (+ (- 256) .cse74))) (let ((.cse71 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse72) 256))) (or (<= .cse71 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse72 .cse71) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse73 .cse7) 256) 127) (<= (mod .cse73 256) 127) (<= .cse74 127))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse77 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse78 (mod .cse77 256))) (let ((.cse75 (+ (- 256) .cse78))) (let ((.cse76 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse75) 256))) (or (not (= (mod (mod .cse75 .cse76) 256) 0)) (<= (mod (+ .cse77 .cse7) 256) 127) (<= .cse78 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse76 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse77 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse80 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse79 (mod (+ .cse80 .cse7) 256))) (let ((.cse81 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse79) 256))) (or (not (<= .cse79 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse79 0) (not (<= (mod .cse80 256) 127)) (<= (mod (+ .cse80 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= .cse81 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse79 .cse81) 256) 0)) (= .cse80 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse82 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse83 (mod .cse82 256))) (let ((.cse84 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse83) 256))) (or (not (<= (mod (+ .cse82 .cse7) 256) 127)) (= .cse83 0) (<= .cse84 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse83 127)) (not (= (mod (mod .cse83 .cse84) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse82 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse26) (or .cse3 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse85 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse87 (mod (+ .cse85 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse86 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse87) 256))) (or (not (<= (mod (+ .cse85 .cse7) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse86 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse87 127)) (<= (mod .cse85 256) 127) (= 0 .cse87) (not (= (mod (mod .cse87 .cse86) 256) 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse88 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse91 (mod .cse88 256))) (let ((.cse89 (+ (- 256) .cse91))) (let ((.cse90 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse89) 256))) (or (not (<= (mod (+ .cse88 .cse7) 256) 127)) (not (= (mod (mod .cse89 .cse90) 256) 0)) (not (<= (mod (+ .cse88 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse91 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse90 |c_ULTIMATE.start_main1_~y~0#1|))))))))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse93 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse92 (mod (+ .cse93 .cse7) 256))) (let ((.cse94 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse92) 256))) (or (not (<= .cse92 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse93 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse92 0) (not (<= (mod .cse93 256) 127)) (<= .cse94 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse92 .cse94) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse95 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse96 (mod .cse95 256))) (let ((.cse97 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse96) 256))) (or (not (<= (mod (+ .cse95 .cse7) 256) 127)) (= .cse96 0) (not (<= (mod (+ .cse95 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse97 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse96 127)) (not (= (mod (mod .cse96 .cse97) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse3 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse100 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse99 (mod (+ .cse100 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse98 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse99) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse98 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse99 127)) (<= (mod (+ .cse100 .cse7) 256) 127) (= 0 .cse99) (not (<= (mod .cse100 256) 127)) (not (= (mod (mod .cse99 .cse98) 256) 0)) (= .cse100 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse102 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse101 (mod .cse102 256))) (let ((.cse103 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse101) 256))) (or (= .cse101 0) (not (<= (mod (+ .cse102 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse102 .cse7) 256) 127) (<= .cse103 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse101 127)) (not (= (mod (mod .cse101 .cse103) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse107 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse106 (mod (+ .cse107 .cse7) 256))) (let ((.cse104 (+ (- 256) .cse106))) (let ((.cse105 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse104) 256))) (or (not (= (mod (mod .cse104 .cse105) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse106 127) (<= .cse105 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse107 256) 127)) (<= (mod (+ .cse107 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse107 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse109 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse108 (mod .cse109 256))) (let ((.cse110 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse108) 256))) (or (= .cse108 0) (<= (mod (+ .cse109 .cse7) 256) 127) (<= .cse110 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse108 127)) (not (= (mod (mod .cse108 .cse110) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse109 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))) .cse26) (or .cse3 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse113 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse114 (mod (+ .cse113 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse112 (+ (- 256) .cse114))) (let ((.cse111 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse112) 256))) (or (<= .cse111 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse112 .cse111) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse113 .cse7) 256) 127) (not (<= (mod .cse113 256) 127)) (<= .cse114 127) (= .cse113 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse116 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse115 (mod .cse116 256))) (let ((.cse117 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse115) 256))) (or (= .cse115 0) (<= (mod (+ .cse116 .cse7) 256) 127) (<= .cse117 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse115 127)) (not (= (mod (mod .cse115 .cse117) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse116 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)))) is different from true [2022-11-20 20:56:41,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-20 20:57:25,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:57:25,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 146.3s TimeCoverageRelationStatistics Valid=62, Invalid=192, Unknown=6, NotChecked=160, Total=420 [2022-11-20 20:57:25,057 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:57:25,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 2 Unknown, 19 Unchecked, 4.1s Time] [2022-11-20 20:57:25,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 139 [2022-11-20 20:57:25,066 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-20 20:57:25,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:57:25,259 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 55 more [2022-11-20 20:57:25,262 INFO L158 Benchmark]: Toolchain (without parser) took 527951.45ms. Allocated memory was 157.3MB in the beginning and 272.6MB in the end (delta: 115.3MB). Free memory was 115.3MB in the beginning and 210.7MB in the end (delta: -95.4MB). Peak memory consumption was 153.1MB. Max. memory is 16.1GB. [2022-11-20 20:57:25,263 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 104.9MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:57:25,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.47ms. Allocated memory is still 157.3MB. Free memory was 114.7MB in the beginning and 103.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 20:57:25,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.34ms. Allocated memory is still 157.3MB. Free memory was 103.3MB in the beginning and 101.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 20:57:25,264 INFO L158 Benchmark]: Boogie Preprocessor took 59.16ms. Allocated memory is still 157.3MB. Free memory was 101.3MB in the beginning and 100.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:57:25,264 INFO L158 Benchmark]: RCFGBuilder took 437.77ms. Allocated memory is still 157.3MB. Free memory was 100.1MB in the beginning and 84.5MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 20:57:25,265 INFO L158 Benchmark]: TraceAbstraction took 526984.92ms. Allocated memory was 157.3MB in the beginning and 272.6MB in the end (delta: 115.3MB). Free memory was 83.9MB in the beginning and 210.7MB in the end (delta: -126.8MB). Peak memory consumption was 121.6MB. Max. memory is 16.1GB. [2022-11-20 20:57:25,267 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 104.9MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.47ms. Allocated memory is still 157.3MB. Free memory was 114.7MB in the beginning and 103.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.34ms. Allocated memory is still 157.3MB. Free memory was 103.3MB in the beginning and 101.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.16ms. Allocated memory is still 157.3MB. Free memory was 101.3MB in the beginning and 100.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 437.77ms. Allocated memory is still 157.3MB. Free memory was 100.1MB in the beginning and 84.5MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 526984.92ms. Allocated memory was 157.3MB in the beginning and 272.6MB in the end (delta: 115.3MB). Free memory was 83.9MB in the beginning and 210.7MB in the end (delta: -126.8MB). Peak memory consumption was 121.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_6.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16f616cbb154d125e085ac05764879da22cdfe3693ed1f1a6c28186441fe892d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 20:57:27,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:57:27,541 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:57:27,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:57:27,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:57:27,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:57:27,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:57:27,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:57:27,597 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:57:27,603 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:57:27,605 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:57:27,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:57:27,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:57:27,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:57:27,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:57:27,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:57:27,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:57:27,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:57:27,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:57:27,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:57:27,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:57:27,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:57:27,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:57:27,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:57:27,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:57:27,643 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:57:27,643 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:57:27,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:57:27,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:57:27,645 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:57:27,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:57:27,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:57:27,647 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:57:27,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:57:27,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:57:27,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:57:27,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:57:27,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:57:27,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:57:27,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:57:27,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:57:27,657 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-20 20:57:27,690 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:57:27,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:57:27,692 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:57:27,692 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:57:27,693 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:57:27,693 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:57:27,693 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:57:27,693 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:57:27,694 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:57:27,694 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:57:27,695 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:57:27,695 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:57:27,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:57:27,696 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 20:57:27,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 20:57:27,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:57:27,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 20:57:27,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:57:27,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 20:57:27,697 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 20:57:27,697 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 20:57:27,697 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 20:57:27,697 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 20:57:27,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 20:57:27,698 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:57:27,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 20:57:27,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:57:27,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 20:57:27,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:57:27,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:57:27,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:57:27,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:57:27,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 20:57:27,700 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-20 20:57:27,700 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 20:57:27,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 20:57:27,700 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:57:27,701 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 20:57:27,701 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16f616cbb154d125e085ac05764879da22cdfe3693ed1f1a6c28186441fe892d [2022-11-20 20:57:28,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:57:28,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:57:28,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:57:28,110 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:57:28,111 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:57:28,112 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/combinations/gcd_2+newton_2_6.i [2022-11-20 20:57:31,131 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:57:31,376 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:57:31,377 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i [2022-11-20 20:57:31,384 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/data/5112be51f/6bb9efe0d75f479c95dc7bb579855f79/FLAGf0bb2fb90 [2022-11-20 20:57:31,405 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/data/5112be51f/6bb9efe0d75f479c95dc7bb579855f79 [2022-11-20 20:57:31,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:57:31,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:57:31,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:57:31,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:57:31,417 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:57:31,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:57:31" (1/1) ... [2022-11-20 20:57:31,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f300f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:57:31, skipping insertion in model container [2022-11-20 20:57:31,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:57:31" (1/1) ... [2022-11-20 20:57:31,427 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:57:31,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:57:31,624 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i[1226,1239] [2022-11-20 20:57:31,651 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i[2841,2854] [2022-11-20 20:57:31,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:57:31,666 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:57:31,681 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i[1226,1239] [2022-11-20 20:57:31,691 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/sv-benchmarks/c/combinations/gcd_2+newton_2_6.i[2841,2854] [2022-11-20 20:57:31,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:57:31,713 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:57:31,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:57:31 WrapperNode [2022-11-20 20:57:31,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:57:31,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:57:31,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:57:31,715 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:57:31,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:57:31" (1/1) ... [2022-11-20 20:57:31,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:57:31" (1/1) ... [2022-11-20 20:57:31,835 INFO L138 Inliner]: procedures = 28, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 80 [2022-11-20 20:57:31,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:57:31,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:57:31,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:57:31,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:57:31,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:57:31" (1/1) ... [2022-11-20 20:57:31,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:57:31" (1/1) ... [2022-11-20 20:57:31,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:57:31" (1/1) ... [2022-11-20 20:57:31,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:57:31" (1/1) ... [2022-11-20 20:57:31,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:57:31" (1/1) ... [2022-11-20 20:57:31,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:57:31" (1/1) ... [2022-11-20 20:57:31,894 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:57:31" (1/1) ... [2022-11-20 20:57:31,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:57:31" (1/1) ... [2022-11-20 20:57:31,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:57:31,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:57:31,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:57:31,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:57:31,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:57:31" (1/1) ... [2022-11-20 20:57:31,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:57:31,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:57:31,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:57:31,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:57:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 20:57:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 20:57:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-20 20:57:31,997 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-20 20:57:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-20 20:57:31,997 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-20 20:57:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:57:31,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:57:32,113 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:57:32,115 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:57:39,323 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:57:39,329 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:57:39,330 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 20:57:39,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:57:39 BoogieIcfgContainer [2022-11-20 20:57:39,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:57:39,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:57:39,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:57:39,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:57:39,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:57:31" (1/3) ... [2022-11-20 20:57:39,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e591f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:57:39, skipping insertion in model container [2022-11-20 20:57:39,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:57:31" (2/3) ... [2022-11-20 20:57:39,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e591f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:57:39, skipping insertion in model container [2022-11-20 20:57:39,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:57:39" (3/3) ... [2022-11-20 20:57:39,342 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_6.i [2022-11-20 20:57:39,355 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:57:39,355 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 20:57:39,401 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:57:39,407 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;@612a6f05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:57:39,408 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-20 20:57:39,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 20:57:39,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 20:57:39,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:57:39,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:57:39,421 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:57:39,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:57:39,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-11-20 20:57:39,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:57:39,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132442278] [2022-11-20 20:57:39,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:39,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:39,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:57:39,455 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:57:39,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-20 20:57:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:39,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 20:57:39,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:39,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:39,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:57:39,700 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:57:39,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132442278] [2022-11-20 20:57:39,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132442278] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:57:39,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:57:39,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:57:39,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392131523] [2022-11-20 20:57:39,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:57:39,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:57:39,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:57:39,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:57:39,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:57:39,737 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:39,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:57:39,764 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2022-11-20 20:57:39,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:57:39,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 20:57:39,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:57:39,773 INFO L225 Difference]: With dead ends: 68 [2022-11-20 20:57:39,774 INFO L226 Difference]: Without dead ends: 30 [2022-11-20 20:57:39,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-11-20 20:57:39,784 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:57:39,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-11-20 20:57:39,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-20 20:57:39,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-20 20:57:39,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 20:57:39,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-20 20:57:39,825 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2022-11-20 20:57:39,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:57:39,825 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-20 20:57:39,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:39,826 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-20 20:57:39,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 20:57:39,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:57:39,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:57:39,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-20 20:57:40,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:40,030 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:57:40,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:57:40,031 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2022-11-20 20:57:40,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:57:40,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309957615] [2022-11-20 20:57:40,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:40,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:40,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:57:40,034 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:57:40,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-20 20:57:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:40,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 20:57:40,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:40,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:40,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:57:40,261 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:57:40,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309957615] [2022-11-20 20:57:40,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309957615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:57:40,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:57:40,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:57:40,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861607709] [2022-11-20 20:57:40,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:57:40,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:57:40,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:57:40,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:57:40,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:57:40,265 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:40,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:57:40,471 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-11-20 20:57:40,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:57:40,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 20:57:40,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:57:40,476 INFO L225 Difference]: With dead ends: 37 [2022-11-20 20:57:40,476 INFO L226 Difference]: Without dead ends: 31 [2022-11-20 20:57:40,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:57:40,478 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:57:40,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 84 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:57:40,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-20 20:57:40,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-11-20 20:57:40,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 20:57:40,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-20 20:57:40,485 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2022-11-20 20:57:40,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:57:40,487 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-20 20:57:40,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-20 20:57:40,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 20:57:40,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:57:40,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:57:40,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-20 20:57:40,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:40,702 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:57:40,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:57:40,703 INFO L85 PathProgramCache]: Analyzing trace with hash 149955676, now seen corresponding path program 1 times [2022-11-20 20:57:40,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:57:40,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784951821] [2022-11-20 20:57:40,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:40,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:40,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:57:40,705 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:57:40,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-20 20:57:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:40,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 20:57:40,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:57:40,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:57:40,927 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:57:40,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784951821] [2022-11-20 20:57:40,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784951821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:57:40,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:57:40,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:57:40,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532356538] [2022-11-20 20:57:40,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:57:40,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:57:40,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:57:40,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:57:40,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:57:40,930 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:41,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:57:41,044 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-11-20 20:57:41,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:57:41,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 20:57:41,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:57:41,045 INFO L225 Difference]: With dead ends: 38 [2022-11-20 20:57:41,045 INFO L226 Difference]: Without dead ends: 30 [2022-11-20 20:57:41,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:57:41,047 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:57:41,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 84 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:57:41,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-20 20:57:41,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-20 20:57:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 20:57:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-20 20:57:41,053 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 12 [2022-11-20 20:57:41,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:57:41,053 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-20 20:57:41,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:41,054 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-20 20:57:41,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 20:57:41,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:57:41,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:57:41,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-11-20 20:57:41,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:41,255 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:57:41,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:57:41,256 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2022-11-20 20:57:41,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:57:41,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907464220] [2022-11-20 20:57:41,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:41,257 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:41,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:57:41,258 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:57:41,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-20 20:57:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:41,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 20:57:41,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:41,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:57:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:42,741 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:57:42,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907464220] [2022-11-20 20:57:42,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907464220] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:57:42,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [599631294] [2022-11-20 20:57:42,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:42,743 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 20:57:42,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/cvc4 [2022-11-20 20:57:42,749 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 20:57:42,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-11-20 20:57:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:43,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 20:57:43,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:43,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:57:43,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:43,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [599631294] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:57:43,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891405913] [2022-11-20 20:57:43,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:43,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:57:43,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:57:43,450 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:57:43,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 20:57:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:43,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 20:57:43,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:43,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:43,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:57:44,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:44,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891405913] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:57:44,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-20 20:57:44,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 7] total 18 [2022-11-20 20:57:44,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443819513] [2022-11-20 20:57:44,573 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-20 20:57:44,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 20:57:44,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:57:44,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 20:57:44,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-11-20 20:57:44,575 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:48,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:57:48,532 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-11-20 20:57:48,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 20:57:48,533 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 20:57:48,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:57:48,533 INFO L225 Difference]: With dead ends: 43 [2022-11-20 20:57:48,534 INFO L226 Difference]: Without dead ends: 20 [2022-11-20 20:57:48,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=248, Invalid=744, Unknown=0, NotChecked=0, Total=992 [2022-11-20 20:57:48,536 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 65 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:57:48,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 159 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-20 20:57:48,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-20 20:57:48,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-20 20:57:48,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 20:57:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-11-20 20:57:48,541 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2022-11-20 20:57:48,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:57:48,541 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-11-20 20:57:48,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:48,541 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-11-20 20:57:48,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 20:57:48,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:57:48,543 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:57:48,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 20:57:48,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-11-20 20:57:48,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-11-20 20:57:49,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:49,149 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:57:49,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:57:49,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1535073882, now seen corresponding path program 1 times [2022-11-20 20:57:49,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:57:49,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425654379] [2022-11-20 20:57:49,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:49,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:49,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:57:49,152 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:57:49,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f28f1624-6a71-4f57-8d3e-ffd0f05de020/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-20 20:59:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 20:59:10,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.