./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_2_8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_8.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh --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 3c398287975b44a672accc5dcc25b28e536e19f2a0478c0e2a0b4b73bd7a8e18 --- 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-2329fc7 [2022-12-14 15:18:33,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:18:33,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:18:33,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:18:33,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:18:33,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:18:33,077 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:18:33,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:18:33,081 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:18:33,081 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:18:33,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:18:33,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:18:33,084 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:18:33,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:18:33,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:18:33,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:18:33,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:18:33,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:18:33,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:18:33,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:18:33,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:18:33,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:18:33,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:18:33,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:18:33,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:18:33,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:18:33,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:18:33,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:18:33,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:18:33,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:18:33,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:18:33,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:18:33,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:18:33,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:18:33,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:18:33,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:18:33,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:18:33,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:18:33,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:18:33,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:18:33,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:18:33,110 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 15:18:33,132 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:18:33,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:18:33,133 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:18:33,133 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:18:33,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:18:33,134 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:18:33,134 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:18:33,134 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:18:33,134 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:18:33,134 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 15:18:33,135 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:18:33,135 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:18:33,135 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 15:18:33,135 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 15:18:33,135 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:18:33,136 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 15:18:33,136 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 15:18:33,136 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 15:18:33,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:18:33,137 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 15:18:33,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 15:18:33,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 15:18:33,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:18:33,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 15:18:33,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:18:33,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 15:18:33,138 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 15:18:33,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 15:18:33,138 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:18:33,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 15:18:33,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:18:33,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:18:33,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:18:33,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:18:33,139 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 15:18:33,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:18:33,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 15:18:33,140 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 15:18:33,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 15:18:33,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 15:18:33,140 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:18:33,140 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_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh 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 -> 3c398287975b44a672accc5dcc25b28e536e19f2a0478c0e2a0b4b73bd7a8e18 [2022-12-14 15:18:33,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:18:33,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:18:33,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:18:33,325 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:18:33,325 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:18:33,326 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/combinations/gcd_2+newton_2_8.i [2022-12-14 15:18:35,862 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:18:35,988 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:18:35,989 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i [2022-12-14 15:18:35,994 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/data/40fec8c47/c49ae9e9831e4c9599c95daf32a9b444/FLAG72c9df824 [2022-12-14 15:18:36,005 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/data/40fec8c47/c49ae9e9831e4c9599c95daf32a9b444 [2022-12-14 15:18:36,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:18:36,008 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:18:36,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:18:36,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:18:36,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:18:36,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:18:36" (1/1) ... [2022-12-14 15:18:36,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2646080c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:18:36, skipping insertion in model container [2022-12-14 15:18:36,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:18:36" (1/1) ... [2022-12-14 15:18:36,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:18:36,039 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:18:36,168 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_dbcd616d-c2f3-4373-8697-acc9094ef238/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i[1226,1239] [2022-12-14 15:18:36,190 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_dbcd616d-c2f3-4373-8697-acc9094ef238/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i[2841,2854] [2022-12-14 15:18:36,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:18:36,202 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 15:18:36,213 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_dbcd616d-c2f3-4373-8697-acc9094ef238/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i[1226,1239] [2022-12-14 15:18:36,224 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_dbcd616d-c2f3-4373-8697-acc9094ef238/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i[2841,2854] [2022-12-14 15:18:36,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:18:36,236 INFO L208 MainTranslator]: Completed translation [2022-12-14 15:18:36,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:18:36 WrapperNode [2022-12-14 15:18:36,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:18:36,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 15:18:36,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 15:18:36,237 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 15:18:36,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:18:36" (1/1) ... [2022-12-14 15:18:36,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:18:36" (1/1) ... [2022-12-14 15:18:36,267 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2022-12-14 15:18:36,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 15:18:36,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 15:18:36,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 15:18:36,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 15:18:36,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:18:36" (1/1) ... [2022-12-14 15:18:36,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:18:36" (1/1) ... [2022-12-14 15:18:36,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:18:36" (1/1) ... [2022-12-14 15:18:36,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:18:36" (1/1) ... [2022-12-14 15:18:36,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:18:36" (1/1) ... [2022-12-14 15:18:36,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:18:36" (1/1) ... [2022-12-14 15:18:36,285 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:18:36" (1/1) ... [2022-12-14 15:18:36,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:18:36" (1/1) ... [2022-12-14 15:18:36,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 15:18:36,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 15:18:36,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 15:18:36,290 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 15:18:36,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:18:36" (1/1) ... [2022-12-14 15:18:36,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:18:36,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:18:36,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 15:18:36,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 15:18:36,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 15:18:36,347 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-12-14 15:18:36,348 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-12-14 15:18:36,348 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-12-14 15:18:36,348 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-12-14 15:18:36,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 15:18:36,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 15:18:36,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 15:18:36,403 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 15:18:36,405 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 15:18:36,528 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 15:18:36,585 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 15:18:36,586 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 15:18:36,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:18:36 BoogieIcfgContainer [2022-12-14 15:18:36,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 15:18:36,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 15:18:36,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 15:18:36,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 15:18:36,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:18:36" (1/3) ... [2022-12-14 15:18:36,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9298b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:18:36, skipping insertion in model container [2022-12-14 15:18:36,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:18:36" (2/3) ... [2022-12-14 15:18:36,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9298b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:18:36, skipping insertion in model container [2022-12-14 15:18:36,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:18:36" (3/3) ... [2022-12-14 15:18:36,598 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_8.i [2022-12-14 15:18:36,620 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 15:18:36,620 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-14 15:18:36,663 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 15:18:36,668 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;@1e191ce4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 15:18:36,668 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-14 15:18:36,672 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-12-14 15:18:36,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:18:36,678 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:18:36,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:18:36,679 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:18:36,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:18:36,683 INFO L85 PathProgramCache]: Analyzing trace with hash -499021812, now seen corresponding path program 1 times [2022-12-14 15:18:36,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:18:36,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784206696] [2022-12-14 15:18:36,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:18:36,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:18:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:18:36,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:18:36,979 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:18:36,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784206696] [2022-12-14 15:18:36,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784206696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:18:36,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:18:36,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:18:36,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642793322] [2022-12-14 15:18:36,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:18:36,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:18:36,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:18:37,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:18:37,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:18:37,009 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-12-14 15:18:37,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:18:37,062 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-12-14 15:18:37,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:18:37,064 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-12-14 15:18:37,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:18:37,069 INFO L225 Difference]: With dead ends: 38 [2022-12-14 15:18:37,069 INFO L226 Difference]: Without dead ends: 21 [2022-12-14 15:18:37,071 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-12-14 15:18:37,073 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:18:37,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:18:37,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-12-14 15:18:37,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-12-14 15:18:37,098 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-12-14 15:18:37,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-12-14 15:18:37,099 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 6 [2022-12-14 15:18:37,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:18:37,100 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-12-14 15:18:37,100 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-12-14 15:18:37,100 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-12-14 15:18:37,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 15:18:37,101 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:18:37,101 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:18:37,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 15:18:37,102 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:18:37,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:18:37,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1643785969, now seen corresponding path program 1 times [2022-12-14 15:18:37,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:18:37,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636116432] [2022-12-14 15:18:37,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:18:37,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:18:37,113 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 15:18:37,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1823577091] [2022-12-14 15:18:37,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:18:37,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:18:37,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:18:37,114 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:18:37,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 15:18:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:18:37,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 15:18:37,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:18:37,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:18:37,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:18:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:18:37,530 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:18:37,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636116432] [2022-12-14 15:18:37,531 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 15:18:37,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823577091] [2022-12-14 15:18:37,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823577091] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:18:37,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1217467654] [2022-12-14 15:18:37,549 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 15:18:37,549 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:18:37,553 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:18:37,558 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:18:37,559 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:18:37,691 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:18:37,946 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-12-14 15:18:37,946 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:18:37,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:18:37,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-12-14 15:18:37,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605594003] [2022-12-14 15:18:37,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 15:18:37,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 15:18:37,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:18:37,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 15:18:37,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-12-14 15:18:37,949 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-12-14 15:18:38,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:18:38,108 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-12-14 15:18:38,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:18:38,108 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-12-14 15:18:38,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:18:38,109 INFO L225 Difference]: With dead ends: 28 [2022-12-14 15:18:38,109 INFO L226 Difference]: Without dead ends: 23 [2022-12-14 15:18:38,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2022-12-14 15:18:38,111 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-14 15:18:38,111 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-12-14 15:18:38,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-12-14 15:18:38,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-12-14 15:18:38,116 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-12-14 15:18:38,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-12-14 15:18:38,116 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 7 [2022-12-14 15:18:38,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:18:38,117 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-12-14 15:18:38,117 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-12-14 15:18:38,117 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-12-14 15:18:38,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 15:18:38,117 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:18:38,118 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2022-12-14 15:18:38,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 15:18:38,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:18:38,319 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:18:38,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:18:38,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1300293201, now seen corresponding path program 2 times [2022-12-14 15:18:38,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:18:38,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144034731] [2022-12-14 15:18:38,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:18:38,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:18:38,344 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 15:18:38,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1132675532] [2022-12-14 15:18:38,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 15:18:38,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:18:38,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:18:38,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:18:38,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 15:18:38,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 15:18:38,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:18:38,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-14 15:18:38,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:18:43,890 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-12-14 15:19:30,846 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-12-14 15:19:35,654 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-12-14 15:19:36,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 15:19:36,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:19:57,142 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse17 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod (+ .cse17 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse21 (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse18 (mod .cse17 256)) (.cse10 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse20 (<= .cse21 127)) (.cse11 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse0 (<= .cse22 127))) (let ((.cse14 (<= .cse22 |c_ULTIMATE.start_main1_~y~0#1|)) (.cse15 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse22) 256) 0))) (.cse16 (not .cse0)) (.cse4 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse21) 256) 0))) (.cse8 (not .cse11)) (.cse9 (not .cse20)) (.cse6 (not .cse10)) (.cse7 (<= .cse21 |c_ULTIMATE.start_main1_~y~0#1|)) (.cse19 (<= .cse18 127))) (and (or (let ((.cse12 (<= .cse18 |c_ULTIMATE.start_main1_~y~0#1|)) (.cse13 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse18) 256) 0)))) (let ((.cse1 (or .cse10 .cse8 .cse12 .cse13)) (.cse5 (= .cse17 0)) (.cse3 (or .cse10 .cse12 .cse13))) (and (or .cse0 (let ((.cse2 (or .cse10 .cse11 .cse12 .cse13))) (and .cse1 .cse2 (or (and (or (and .cse3 (or .cse4 .cse5 .cse6 .cse7)) .cse8) .cse2) .cse9)))) (or (and .cse1 (or .cse9 (and (or (and (or .cse14 .cse15 .cse6) .cse3) .cse11) (or .cse8 (and (or .cse4 .cse6 .cse7) .cse3)))) (or .cse11 (and (or .cse14 .cse5 .cse15 .cse6) .cse3))) .cse16)))) (not .cse19)) (or (and (or (and (or .cse9 (and (or .cse4 .cse8 .cse6 .cse7) (or .cse14 .cse15 .cse11 .cse6))) (or .cse14 .cse15 .cse11 .cse20 .cse6)) .cse16) (or .cse4 .cse8 .cse0 .cse9 .cse6 .cse7)) .cse19)))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) is different from true [2022-12-14 15:24:20,164 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse35 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (let ((.cse0 (not .cse35)) (.cse4 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (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 ((.cse3 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod (+ .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse2 (+ (- 256) .cse6))) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse2))) (let ((.cse1 (mod .cse5 256))) (or (<= .cse1 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse2 .cse1) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse3 .cse4) 256) 127) (<= (mod .cse3 256) 127) (not (<= (mod (+ (* .cse3 255) .cse4 .cse5) 256) 127)) (<= .cse6 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 ((.cse9 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse10 (mod .cse9 256))) (let ((.cse7 (+ (- 256) .cse10))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse7))) (let ((.cse8 (mod .cse11 256))) (or (not (= (mod (mod .cse7 .cse8) 256) 0)) (<= (mod (+ .cse9 .cse4) 256) 127) (<= .cse10 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse8 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse9 255) .cse11) 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 ((.cse12 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse12 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse15 (+ (- 256) .cse16))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse15))) (let ((.cse14 (mod .cse13 256))) (or (<= (mod (+ (* .cse12 255) .cse4 .cse13) 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 (+ .cse12 .cse4) 256) 127) (<= (mod .cse12 256) 127) (<= .cse16 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 ((.cse19 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse21 (mod .cse19 256))) (let ((.cse17 (+ (- 256) .cse21))) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse17))) (let ((.cse18 (mod .cse20 256))) (or (not (= (mod (mod .cse17 .cse18) 256) 0)) (not (<= (mod (+ (* .cse19 255) .cse20) 256) 127)) (<= (mod (+ .cse19 .cse4) 256) 127) (<= .cse21 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse18 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))))))) (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 ((.cse22 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod .cse22 256))) (let ((.cse23 (+ (- 256) .cse25))) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse23))) (let ((.cse24 (mod .cse26 256))) (or (not (<= (mod (+ .cse22 .cse4) 256) 127)) (not (= (mod (mod .cse23 .cse24) 256) 0)) (not (<= (mod (+ .cse22 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse25 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse24 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ (* .cse22 255) .cse26) 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 ((.cse27 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse28 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse29) 256))) (or (not (<= (mod (+ .cse27 .cse4) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse28 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse29 127)) (<= (mod .cse27 256) 127) (= 0 .cse29) (not (= (mod (mod .cse29 .cse28) 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 ((.cse30 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod .cse30 256))) (let ((.cse31 (+ (- 256) .cse33))) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse31))) (let ((.cse32 (mod .cse34 256))) (or (not (<= (mod (+ .cse30 .cse4) 256) 127)) (not (= (mod (mod .cse31 .cse32) 256) 0)) (not (<= (mod (+ .cse30 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse33 127) (< 127 (mod (+ (* .cse30 255) .cse34) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse32 |c_ULTIMATE.start_main1_~y~0#1|))))))))))) .cse0) (or .cse35 (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 ((.cse38 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse39 (mod (+ .cse38 .cse4) 256))) (let ((.cse36 (+ (- 256) .cse39))) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse36))) (let ((.cse37 (mod .cse40 256))) (or (not (= (mod (mod .cse36 .cse37) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse38 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse39 127) (<= (mod .cse38 256) 127) (<= .cse37 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ (* .cse38 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse40) 256) 127)))))))))) (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 ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse41))) (let ((.cse42 (mod .cse45 256))) (or (not (= (mod (mod .cse41 .cse42) 256) 0)) (not (<= (mod (+ .cse43 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse43 .cse4) 256) 127) (<= .cse44 127) (< 127 (mod (+ (* .cse43 255) .cse45) 256)) (< |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 (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse48 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse49 (mod .cse48 256))) (let ((.cse46 (+ (- 256) .cse49))) (let ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse46))) (let ((.cse47 (mod .cse50 256))) (or (not (= (mod (mod .cse46 .cse47) 256) 0)) (not (<= (mod (+ .cse48 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse48 .cse4) 256) 127) (<= .cse49 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse47 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ (* .cse48 255) .cse50) 256) 127)))))))))) (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 ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse55 (mod (+ .cse51 .cse4) 256))) (let ((.cse53 (+ (- 256) .cse55))) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse53))) (let ((.cse54 (mod .cse52 256))) (or (< 127 (mod (+ (* .cse51 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse52) 256)) (not (= (mod (mod .cse53 .cse54) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse55 127) (<= (mod .cse51 256) 127) (<= .cse54 |c_ULTIMATE.start_main1_~y~0#1|)))))))))))) (or .cse0 (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 ((.cse57 (mod .cse56 256))) (let ((.cse58 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse57) 256))) (or (not (<= (mod (+ .cse56 .cse4) 256) 127)) (= .cse57 0) (not (<= (mod (+ .cse56 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse58 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse57 127)) (not (= (mod (mod .cse57 .cse58) 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 ((.cse59 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse61 (mod (+ .cse59 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse60 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse61) 256))) (or (not (<= (mod (+ .cse59 .cse4) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse60 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse61 127)) (= 0 .cse61) (not (<= (mod .cse59 256) 127)) (not (= (mod (mod .cse61 .cse60) 256) 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 ((.cse63 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse62 (mod .cse63 256))) (let ((.cse64 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse62) 256))) (or (= .cse62 0) (not (<= (mod (+ .cse63 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse63 .cse4) 256) 127) (<= .cse64 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse62 127)) (not (= (mod (mod .cse62 .cse64) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 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 ((.cse67 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse68 (mod (+ .cse67 .cse4) 256))) (let ((.cse65 (+ (- 256) .cse68))) (let ((.cse69 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse65))) (let ((.cse66 (mod .cse69 256))) (or (not (= (mod (mod .cse65 .cse66) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse67 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse68 127) (<= .cse66 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse67 256) 127)) (<= (mod (+ (* .cse67 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse69) 256) 127) (= .cse67 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse72 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse74 (mod (+ .cse72 .cse4) 256))) (let ((.cse70 (+ (- 256) .cse74))) (let ((.cse73 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse70))) (let ((.cse71 (mod .cse73 256))) (or (not (= (mod (mod .cse70 .cse71) 256) 0)) (not (<= (mod (+ (* .cse72 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse73) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse72 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse74 127) (<= .cse71 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse72 256) 127)) (= .cse72 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse35) (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 ((.cse76 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse75 (mod .cse76 256))) (let ((.cse77 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse75) 256))) (or (= .cse75 0) (<= (mod (+ .cse76 .cse4) 256) 127) (<= .cse77 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse75 127)) (not (= (mod (mod .cse75 .cse77) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse76 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse78 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse82 (mod (+ .cse78 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse81 (+ (- 256) .cse82))) (let ((.cse79 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse81))) (let ((.cse80 (mod .cse79 256))) (or (<= (mod (+ (* .cse78 255) .cse4 .cse79) 256) 127) (<= .cse80 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse81 .cse80) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse78 .cse4) 256) 127) (not (<= (mod .cse78 256) 127)) (<= .cse82 127) (= .cse78 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 ((.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 ((.cse84 (+ (- 256) .cse87))) (let ((.cse86 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse84))) (let ((.cse83 (mod .cse86 256))) (or (<= .cse83 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse84 .cse83) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse85 .cse4) 256) 127) (not (<= (mod (+ (* .cse85 255) .cse4 .cse86) 256) 127)) (not (<= (mod .cse85 256) 127)) (<= .cse87 127)))))))))))) (or .cse35 (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 ((.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 ((.cse92 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse89))) (let ((.cse90 (mod .cse92 256))) (or (not (<= (mod (+ .cse88 .cse4) 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|) (<= (mod (+ (* .cse88 255) .cse92) 256) 127)))))))))) (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 ((.cse93 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse97 (mod .cse93 256))) (let ((.cse94 (+ (- 256) .cse97))) (let ((.cse96 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse94))) (let ((.cse95 (mod .cse96 256))) (or (not (<= (mod (+ .cse93 .cse4) 256) 127)) (not (= (mod (mod .cse94 .cse95) 256) 0)) (not (<= (mod (+ (* .cse93 255) .cse96) 256) 127)) (not (<= (mod (+ .cse93 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse97 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse95 |c_ULTIMATE.start_main1_~y~0#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 ((.cse99 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse98 (mod (+ .cse99 .cse4) 256))) (let ((.cse100 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse98) 256))) (or (not (<= .cse98 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse99 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse98 0) (<= (mod .cse99 256) 127) (<= .cse100 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse98 .cse100) 256) 0))))))))))) (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 ((.cse101 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse105 (mod (+ .cse101 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse104 (+ (- 256) .cse105))) (let ((.cse102 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse104))) (let ((.cse103 (mod .cse102 256))) (or (not (<= (mod (+ .cse101 .cse4) 256) 127)) (<= (mod (+ (* .cse101 255) .cse4 .cse102) 256) 127) (<= .cse103 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse104 .cse103) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse101 256) 127) (<= .cse105 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 ((.cse106 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse110 (mod .cse106 256))) (let ((.cse107 (+ (- 256) .cse110))) (let ((.cse109 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse107))) (let ((.cse108 (mod .cse109 256))) (or (not (<= (mod (+ .cse106 .cse4) 256) 127)) (not (= (mod (mod .cse107 .cse108) 256) 0)) (not (<= (mod (+ (* .cse106 255) .cse109) 256) 127)) (<= .cse110 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse108 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse106 |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 ((.cse111 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse114 (mod .cse111 256))) (let ((.cse112 (+ (- 256) .cse114))) (let ((.cse115 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse112))) (let ((.cse113 (mod .cse115 256))) (or (not (<= (mod (+ .cse111 .cse4) 256) 127)) (not (= (mod (mod .cse112 .cse113) 256) 0)) (<= .cse114 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse113 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse111 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse111 255) .cse115) 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 ((.cse116 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse120 (mod (+ .cse116 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse118 (+ (- 256) .cse120))) (let ((.cse119 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse118))) (let ((.cse117 (mod .cse119 256))) (or (not (<= (mod (+ .cse116 .cse4) 256) 127)) (<= .cse117 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse118 .cse117) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse116 256) 127) (not (<= (mod (+ (* .cse116 255) .cse4 .cse119) 256) 127)) (<= .cse120 127)))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse122 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse121 (mod (+ .cse122 .cse4) 256))) (let ((.cse123 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse121) 256))) (or (not (<= .cse121 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse121 0) (not (<= (mod .cse122 256) 127)) (<= (mod (+ .cse122 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= .cse123 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse121 .cse123) 256) 0)) (= .cse122 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 ((.cse124 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse125 (mod .cse124 256))) (let ((.cse126 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse125) 256))) (or (not (<= (mod (+ .cse124 .cse4) 256) 127)) (= .cse125 0) (<= .cse126 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse125 127)) (not (= (mod (mod .cse125 .cse126) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse124 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse35) (or .cse35 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse128 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse127 (mod (+ .cse128 .cse4) 256))) (let ((.cse129 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse127) 256))) (or (not (<= .cse127 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse128 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse127 0) (not (<= (mod .cse128 256) 127)) (<= .cse129 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse127 .cse129) 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 ((.cse130 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse131 (mod .cse130 256))) (let ((.cse132 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse131) 256))) (or (not (<= (mod (+ .cse130 .cse4) 256) 127)) (= .cse131 0) (not (<= (mod (+ .cse130 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse132 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse131 127)) (not (= (mod (mod .cse131 .cse132) 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 .cse35 (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 ((.cse135 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse136 (mod .cse135 256))) (let ((.cse133 (+ (- 256) .cse136))) (let ((.cse137 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse133))) (let ((.cse134 (mod .cse137 256))) (or (not (= (mod (mod .cse133 .cse134) 256) 0)) (<= (mod (+ .cse135 .cse4) 256) 127) (<= .cse136 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse134 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse135 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse135 255) .cse137) 256) 127)))))))))) (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 ((.cse140 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse142 (mod (+ .cse140 .cse4) 256))) (let ((.cse138 (+ (- 256) .cse142))) (let ((.cse141 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse138))) (let ((.cse139 (mod .cse141 256))) (or (not (= (mod (mod .cse138 .cse139) 256) 0)) (not (<= (mod (+ (* .cse140 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse141) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse142 127) (<= (mod .cse140 256) 127) (<= .cse139 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse140 |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| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse146 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse145 (mod (+ .cse146 .cse4) 256))) (let ((.cse143 (+ (- 256) .cse145))) (let ((.cse147 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse143))) (let ((.cse144 (mod .cse147 256))) (or (not (= (mod (mod .cse143 .cse144) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse145 127) (<= (mod .cse146 256) 127) (<= .cse144 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse146 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse146 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse147) 256) 127)))))))))) (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 ((.cse150 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse152 (mod .cse150 256))) (let ((.cse148 (+ (- 256) .cse152))) (let ((.cse151 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse148))) (let ((.cse149 (mod .cse151 256))) (or (not (= (mod (mod .cse148 .cse149) 256) 0)) (not (<= (mod (+ (* .cse150 255) .cse151) 256) 127)) (<= (mod (+ .cse150 .cse4) 256) 127) (<= .cse152 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse149 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse150 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))))))) (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 ((.cse155 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse154 (mod (+ .cse155 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse153 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse154) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse153 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse154 127)) (<= (mod (+ .cse155 .cse4) 256) 127) (= 0 .cse154) (not (<= (mod .cse155 256) 127)) (not (= (mod (mod .cse154 .cse153) 256) 0)) (= .cse155 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 ((.cse157 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse156 (mod .cse157 256))) (let ((.cse158 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse156) 256))) (or (= .cse156 0) (not (<= (mod (+ .cse157 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse157 .cse4) 256) 127) (<= .cse158 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse156 127)) (not (= (mod (mod .cse156 .cse158) 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 ((.cse162 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse161 (mod (+ .cse162 .cse4) 256))) (let ((.cse159 (+ (- 256) .cse161))) (let ((.cse163 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse159))) (let ((.cse160 (mod .cse163 256))) (or (not (= (mod (mod .cse159 .cse160) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse161 127) (<= .cse160 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse162 256) 127)) (<= (mod (+ .cse162 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse162 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse163) 256) 127) (= .cse162 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 ((.cse165 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse164 (mod .cse165 256))) (let ((.cse166 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse164) 256))) (or (= .cse164 0) (<= (mod (+ .cse165 .cse4) 256) 127) (<= .cse166 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse164 127)) (not (= (mod (mod .cse164 .cse166) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse165 |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| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse169 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse171 (mod (+ .cse169 .cse4) 256))) (let ((.cse167 (+ (- 256) .cse171))) (let ((.cse170 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse167))) (let ((.cse168 (mod .cse170 256))) (or (not (= (mod (mod .cse167 .cse168) 256) 0)) (not (<= (mod (+ (* .cse169 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse170) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse171 127) (<= .cse168 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse169 256) 127)) (<= (mod (+ .cse169 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))))) .cse35) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse172 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse173 (mod .cse172 256))) (let ((.cse174 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse173) 256))) (or (not (<= (mod (+ .cse172 .cse4) 256) 127)) (= .cse173 0) (<= .cse174 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse173 127)) (not (= (mod (mod .cse173 .cse174) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse172 |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 ((.cse175 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse179 (mod (+ .cse175 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse178 (+ (- 256) .cse179))) (let ((.cse176 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse178))) (let ((.cse177 (mod .cse176 256))) (or (not (<= (mod (+ .cse175 .cse4) 256) 127)) (<= (mod (+ (* .cse175 255) .cse4 .cse176) 256) 127) (<= .cse177 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse178 .cse177) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod .cse175 256) 127)) (<= .cse179 127) (= .cse175 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse180 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse184 (mod (+ .cse180 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse182 (+ (- 256) .cse184))) (let ((.cse183 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse182))) (let ((.cse181 (mod .cse183 256))) (or (not (<= (mod (+ .cse180 .cse4) 256) 127)) (<= .cse181 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse182 .cse181) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ (* .cse180 255) .cse4 .cse183) 256) 127)) (not (<= (mod .cse180 256) 127)) (<= .cse184 127) (= .cse180 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))))) (or .cse35 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse186 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse185 (mod (+ .cse186 .cse4) 256))) (let ((.cse187 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse185) 256))) (or (not (<= .cse185 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse185 0) (<= (mod .cse186 256) 127) (<= (mod (+ .cse186 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= .cse187 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse185 .cse187) 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 ((.cse188 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse192 (mod .cse188 256))) (let ((.cse189 (+ (- 256) .cse192))) (let ((.cse191 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse189))) (let ((.cse190 (mod .cse191 256))) (or (not (<= (mod (+ .cse188 .cse4) 256) 127)) (not (= (mod (mod .cse189 .cse190) 256) 0)) (not (<= (mod (+ (* .cse188 255) .cse191) 256) 127)) (<= .cse192 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse190 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse188 |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| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse193 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse196 (mod .cse193 256))) (let ((.cse194 (+ (- 256) .cse196))) (let ((.cse197 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse194))) (let ((.cse195 (mod .cse197 256))) (or (not (<= (mod (+ .cse193 .cse4) 256) 127)) (not (= (mod (mod .cse194 .cse195) 256) 0)) (<= .cse196 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse195 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse193 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse193 255) .cse197) 256) 127)))))))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse200 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse199 (mod (+ .cse200 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse198 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse199) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse198 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse199 127)) (<= (mod (+ .cse200 .cse4) 256) 127) (<= (mod .cse200 256) 127) (= 0 .cse199) (not (= (mod (mod .cse199 .cse198) 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 ((.cse203 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse204 (mod .cse203 256))) (let ((.cse201 (+ (- 256) .cse204))) (let ((.cse205 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse201))) (let ((.cse202 (mod .cse205 256))) (or (not (= (mod (mod .cse201 .cse202) 256) 0)) (not (<= (mod (+ .cse203 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse203 .cse4) 256) 127) (<= .cse204 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse202 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ (* .cse203 255) .cse205) 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 ((.cse208 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse209 (mod .cse208 256))) (let ((.cse206 (+ (- 256) .cse209))) (let ((.cse210 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse206))) (let ((.cse207 (mod .cse210 256))) (or (not (= (mod (mod .cse206 .cse207) 256) 0)) (not (<= (mod (+ .cse208 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse208 .cse4) 256) 127) (<= .cse209 127) (< 127 (mod (+ (* .cse208 255) .cse210) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse207 |c_ULTIMATE.start_main1_~y~0#1|))))))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) is different from true [2022-12-14 15:24:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 15:24:21,280 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:21,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144034731] [2022-12-14 15:24:21,280 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 15:24:21,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132675532] [2022-12-14 15:24:21,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132675532] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:24:21,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2094269098] [2022-12-14 15:24:21,283 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 15:24:21,283 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:24:21,283 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:24:21,283 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:24:21,283 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:24:21,364 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:24:21,884 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-12-14 15:24:21,884 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:24:21,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:24:21,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-12-14 15:24:21,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708539381] [2022-12-14 15:24:21,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 15:24:21,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:24:21,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:21,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:24:21,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=148, Unknown=5, NotChecked=140, Total=342 [2022-12-14 15:24:21,886 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-12-14 15:24:23,955 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|)))) (or (let ((.cse38 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (let ((.cse3 (not .cse38)) (.cse7 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (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 ((.cse6 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod (+ .cse6 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse5 (+ (- 256) .cse9))) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse5))) (let ((.cse4 (mod .cse8 256))) (or (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse5 .cse4) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse6 .cse7) 256) 127) (<= (mod .cse6 256) 127) (not (<= (mod (+ (* .cse6 255) .cse7 .cse8) 256) 127)) (<= .cse9 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 ((.cse12 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse13 (mod .cse12 256))) (let ((.cse10 (+ (- 256) .cse13))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse10))) (let ((.cse11 (mod .cse14 256))) (or (not (= (mod (mod .cse10 .cse11) 256) 0)) (<= (mod (+ .cse12 .cse7) 256) 127) (<= .cse13 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse11 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse12 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse12 255) .cse14) 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 ((.cse15 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse19 (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse18 (+ (- 256) .cse19))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse18))) (let ((.cse17 (mod .cse16 256))) (or (<= (mod (+ (* .cse15 255) .cse7 .cse16) 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 (+ .cse15 .cse7) 256) 127) (<= (mod .cse15 256) 127) (<= .cse19 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 ((.cse22 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod .cse22 256))) (let ((.cse20 (+ (- 256) .cse24))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse20))) (let ((.cse21 (mod .cse23 256))) (or (not (= (mod (mod .cse20 .cse21) 256) 0)) (not (<= (mod (+ (* .cse22 255) .cse23) 256) 127)) (<= (mod (+ .cse22 .cse7) 256) 127) (<= .cse24 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse21 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse22 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))))))) (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 ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod .cse25 256))) (let ((.cse26 (+ (- 256) .cse28))) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse26))) (let ((.cse27 (mod .cse29 256))) (or (not (<= (mod (+ .cse25 .cse7) 256) 127)) (not (= (mod (mod .cse26 .cse27) 256) 0)) (not (<= (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse28 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse27 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ (* .cse25 255) .cse29) 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 ((.cse30 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse32 (mod (+ .cse30 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse31 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse32) 256))) (or (not (<= (mod (+ .cse30 .cse7) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse31 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse32 127)) (<= (mod .cse30 256) 127) (= 0 .cse32) (not (= (mod (mod .cse32 .cse31) 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 ((.cse33 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse36 (mod .cse33 256))) (let ((.cse34 (+ (- 256) .cse36))) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse34))) (let ((.cse35 (mod .cse37 256))) (or (not (<= (mod (+ .cse33 .cse7) 256) 127)) (not (= (mod (mod .cse34 .cse35) 256) 0)) (not (<= (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse36 127) (< 127 (mod (+ (* .cse33 255) .cse37) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse35 |c_ULTIMATE.start_main1_~y~0#1|))))))))))) .cse3) (or .cse38 (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 ((.cse41 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse42 (mod (+ .cse41 .cse7) 256))) (let ((.cse39 (+ (- 256) .cse42))) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse39))) (let ((.cse40 (mod .cse43 256))) (or (not (= (mod (mod .cse39 .cse40) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse42 127) (<= (mod .cse41 256) 127) (<= .cse40 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ (* .cse41 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse43) 256) 127)))))))))) (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 ((.cse46 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse47 (mod .cse46 256))) (let ((.cse44 (+ (- 256) .cse47))) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse44))) (let ((.cse45 (mod .cse48 256))) (or (not (= (mod (mod .cse44 .cse45) 256) 0)) (not (<= (mod (+ .cse46 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse46 .cse7) 256) 127) (<= .cse47 127) (< 127 (mod (+ (* .cse46 255) .cse48) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse45 |c_ULTIMATE.start_main1_~y~0#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 ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse52 (mod .cse51 256))) (let ((.cse49 (+ (- 256) .cse52))) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse49))) (let ((.cse50 (mod .cse53 256))) (or (not (= (mod (mod .cse49 .cse50) 256) 0)) (not (<= (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse51 .cse7) 256) 127) (<= .cse52 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse50 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ (* .cse51 255) .cse53) 256) 127)))))))))) (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 ((.cse54 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse58 (mod (+ .cse54 .cse7) 256))) (let ((.cse56 (+ (- 256) .cse58))) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse56))) (let ((.cse57 (mod .cse55 256))) (or (< 127 (mod (+ (* .cse54 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse55) 256)) (not (= (mod (mod .cse56 .cse57) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse54 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse58 127) (<= (mod .cse54 256) 127) (<= .cse57 |c_ULTIMATE.start_main1_~y~0#1|)))))))))))) (or .cse3 (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 ((.cse60 (mod .cse59 256))) (let ((.cse61 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse60) 256))) (or (not (<= (mod (+ .cse59 .cse7) 256) 127)) (= .cse60 0) (not (<= (mod (+ .cse59 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse61 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse60 127)) (not (= (mod (mod .cse60 .cse61) 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 ((.cse62 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse64 (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse63 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse64) 256))) (or (not (<= (mod (+ .cse62 .cse7) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse63 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse64 127)) (= 0 .cse64) (not (<= (mod .cse62 256) 127)) (not (= (mod (mod .cse64 .cse63) 256) 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 ((.cse66 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse65 (mod .cse66 256))) (let ((.cse67 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse65) 256))) (or (= .cse65 0) (not (<= (mod (+ .cse66 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse66 .cse7) 256) 127) (<= .cse67 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse65 127)) (not (= (mod (mod .cse65 .cse67) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 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 ((.cse70 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse71 (mod (+ .cse70 .cse7) 256))) (let ((.cse68 (+ (- 256) .cse71))) (let ((.cse72 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse68))) (let ((.cse69 (mod .cse72 256))) (or (not (= (mod (mod .cse68 .cse69) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse70 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse71 127) (<= .cse69 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse70 256) 127)) (<= (mod (+ (* .cse70 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse72) 256) 127) (= .cse70 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse75 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse77 (mod (+ .cse75 .cse7) 256))) (let ((.cse73 (+ (- 256) .cse77))) (let ((.cse76 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse73))) (let ((.cse74 (mod .cse76 256))) (or (not (= (mod (mod .cse73 .cse74) 256) 0)) (not (<= (mod (+ (* .cse75 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse76) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse75 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse77 127) (<= .cse74 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse75 256) 127)) (= .cse75 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse38) (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 ((.cse79 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse78 (mod .cse79 256))) (let ((.cse80 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse78) 256))) (or (= .cse78 0) (<= (mod (+ .cse79 .cse7) 256) 127) (<= .cse80 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse78 127)) (not (= (mod (mod .cse78 .cse80) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse79 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse81 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse85 (mod (+ .cse81 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse84 (+ (- 256) .cse85))) (let ((.cse82 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse84))) (let ((.cse83 (mod .cse82 256))) (or (<= (mod (+ (* .cse81 255) .cse7 .cse82) 256) 127) (<= .cse83 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse84 .cse83) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse81 .cse7) 256) 127) (not (<= (mod .cse81 256) 127)) (<= .cse85 127) (= .cse81 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 ((.cse88 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse90 (mod (+ .cse88 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse87 (+ (- 256) .cse90))) (let ((.cse89 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse87))) (let ((.cse86 (mod .cse89 256))) (or (<= .cse86 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse87 .cse86) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse88 .cse7) 256) 127) (not (<= (mod (+ (* .cse88 255) .cse7 .cse89) 256) 127)) (not (<= (mod .cse88 256) 127)) (<= .cse90 127)))))))))))) (or .cse38 (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 ((.cse91 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse94 (mod .cse91 256))) (let ((.cse92 (+ (- 256) .cse94))) (let ((.cse95 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse92))) (let ((.cse93 (mod .cse95 256))) (or (not (<= (mod (+ .cse91 .cse7) 256) 127)) (not (= (mod (mod .cse92 .cse93) 256) 0)) (not (<= (mod (+ .cse91 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse94 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse93 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ (* .cse91 255) .cse95) 256) 127)))))))))) (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 ((.cse96 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse100 (mod .cse96 256))) (let ((.cse97 (+ (- 256) .cse100))) (let ((.cse99 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse97))) (let ((.cse98 (mod .cse99 256))) (or (not (<= (mod (+ .cse96 .cse7) 256) 127)) (not (= (mod (mod .cse97 .cse98) 256) 0)) (not (<= (mod (+ (* .cse96 255) .cse99) 256) 127)) (not (<= (mod (+ .cse96 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse100 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse98 |c_ULTIMATE.start_main1_~y~0#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 ((.cse102 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse101 (mod (+ .cse102 .cse7) 256))) (let ((.cse103 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse101) 256))) (or (not (<= .cse101 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse102 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse101 0) (<= (mod .cse102 256) 127) (<= .cse103 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse101 .cse103) 256) 0))))))))))) (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 ((.cse104 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse108 (mod (+ .cse104 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse107 (+ (- 256) .cse108))) (let ((.cse105 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse107))) (let ((.cse106 (mod .cse105 256))) (or (not (<= (mod (+ .cse104 .cse7) 256) 127)) (<= (mod (+ (* .cse104 255) .cse7 .cse105) 256) 127) (<= .cse106 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse107 .cse106) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse104 256) 127) (<= .cse108 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 ((.cse109 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse113 (mod .cse109 256))) (let ((.cse110 (+ (- 256) .cse113))) (let ((.cse112 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse110))) (let ((.cse111 (mod .cse112 256))) (or (not (<= (mod (+ .cse109 .cse7) 256) 127)) (not (= (mod (mod .cse110 .cse111) 256) 0)) (not (<= (mod (+ (* .cse109 255) .cse112) 256) 127)) (<= .cse113 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse111 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse109 |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 ((.cse114 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse117 (mod .cse114 256))) (let ((.cse115 (+ (- 256) .cse117))) (let ((.cse118 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse115))) (let ((.cse116 (mod .cse118 256))) (or (not (<= (mod (+ .cse114 .cse7) 256) 127)) (not (= (mod (mod .cse115 .cse116) 256) 0)) (<= .cse117 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse116 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse114 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse114 255) .cse118) 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 ((.cse119 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse123 (mod (+ .cse119 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse121 (+ (- 256) .cse123))) (let ((.cse122 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse121))) (let ((.cse120 (mod .cse122 256))) (or (not (<= (mod (+ .cse119 .cse7) 256) 127)) (<= .cse120 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse121 .cse120) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse119 256) 127) (not (<= (mod (+ (* .cse119 255) .cse7 .cse122) 256) 127)) (<= .cse123 127)))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse125 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse124 (mod (+ .cse125 .cse7) 256))) (let ((.cse126 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse124) 256))) (or (not (<= .cse124 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse124 0) (not (<= (mod .cse125 256) 127)) (<= (mod (+ .cse125 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= .cse126 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse124 .cse126) 256) 0)) (= .cse125 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 ((.cse127 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse128 (mod .cse127 256))) (let ((.cse129 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse128) 256))) (or (not (<= (mod (+ .cse127 .cse7) 256) 127)) (= .cse128 0) (<= .cse129 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse128 127)) (not (= (mod (mod .cse128 .cse129) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse127 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse38) (or .cse38 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse131 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse130 (mod (+ .cse131 .cse7) 256))) (let ((.cse132 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse130) 256))) (or (not (<= .cse130 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse131 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse130 0) (not (<= (mod .cse131 256) 127)) (<= .cse132 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse130 .cse132) 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 ((.cse133 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse134 (mod .cse133 256))) (let ((.cse135 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse134) 256))) (or (not (<= (mod (+ .cse133 .cse7) 256) 127)) (= .cse134 0) (not (<= (mod (+ .cse133 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse135 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse134 127)) (not (= (mod (mod .cse134 .cse135) 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 .cse38 (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 ((.cse138 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse139 (mod .cse138 256))) (let ((.cse136 (+ (- 256) .cse139))) (let ((.cse140 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse136))) (let ((.cse137 (mod .cse140 256))) (or (not (= (mod (mod .cse136 .cse137) 256) 0)) (<= (mod (+ .cse138 .cse7) 256) 127) (<= .cse139 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse137 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse138 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse138 255) .cse140) 256) 127)))))))))) (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 ((.cse143 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse145 (mod (+ .cse143 .cse7) 256))) (let ((.cse141 (+ (- 256) .cse145))) (let ((.cse144 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse141))) (let ((.cse142 (mod .cse144 256))) (or (not (= (mod (mod .cse141 .cse142) 256) 0)) (not (<= (mod (+ (* .cse143 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse144) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse145 127) (<= (mod .cse143 256) 127) (<= .cse142 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse143 |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| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse149 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse148 (mod (+ .cse149 .cse7) 256))) (let ((.cse146 (+ (- 256) .cse148))) (let ((.cse150 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse146))) (let ((.cse147 (mod .cse150 256))) (or (not (= (mod (mod .cse146 .cse147) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse148 127) (<= (mod .cse149 256) 127) (<= .cse147 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse149 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse149 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse150) 256) 127)))))))))) (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 ((.cse153 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse155 (mod .cse153 256))) (let ((.cse151 (+ (- 256) .cse155))) (let ((.cse154 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse151))) (let ((.cse152 (mod .cse154 256))) (or (not (= (mod (mod .cse151 .cse152) 256) 0)) (not (<= (mod (+ (* .cse153 255) .cse154) 256) 127)) (<= (mod (+ .cse153 .cse7) 256) 127) (<= .cse155 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse152 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse153 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))))))) (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 ((.cse158 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse157 (mod (+ .cse158 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse156 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse157) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse156 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse157 127)) (<= (mod (+ .cse158 .cse7) 256) 127) (= 0 .cse157) (not (<= (mod .cse158 256) 127)) (not (= (mod (mod .cse157 .cse156) 256) 0)) (= .cse158 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 ((.cse160 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse159 (mod .cse160 256))) (let ((.cse161 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse159) 256))) (or (= .cse159 0) (not (<= (mod (+ .cse160 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse160 .cse7) 256) 127) (<= .cse161 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse159 127)) (not (= (mod (mod .cse159 .cse161) 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 ((.cse165 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse164 (mod (+ .cse165 .cse7) 256))) (let ((.cse162 (+ (- 256) .cse164))) (let ((.cse166 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse162))) (let ((.cse163 (mod .cse166 256))) (or (not (= (mod (mod .cse162 .cse163) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse164 127) (<= .cse163 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse165 256) 127)) (<= (mod (+ .cse165 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse165 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse166) 256) 127) (= .cse165 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 ((.cse168 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse167 (mod .cse168 256))) (let ((.cse169 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse167) 256))) (or (= .cse167 0) (<= (mod (+ .cse168 .cse7) 256) 127) (<= .cse169 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse167 127)) (not (= (mod (mod .cse167 .cse169) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse168 |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| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse172 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse174 (mod (+ .cse172 .cse7) 256))) (let ((.cse170 (+ (- 256) .cse174))) (let ((.cse173 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse170))) (let ((.cse171 (mod .cse173 256))) (or (not (= (mod (mod .cse170 .cse171) 256) 0)) (not (<= (mod (+ (* .cse172 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse173) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse174 127) (<= .cse171 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse172 256) 127)) (<= (mod (+ .cse172 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))))) .cse38) (or .cse3 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse175 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse176 (mod .cse175 256))) (let ((.cse177 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse176) 256))) (or (not (<= (mod (+ .cse175 .cse7) 256) 127)) (= .cse176 0) (<= .cse177 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse176 127)) (not (= (mod (mod .cse176 .cse177) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse175 |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 ((.cse178 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse182 (mod (+ .cse178 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse181 (+ (- 256) .cse182))) (let ((.cse179 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse181))) (let ((.cse180 (mod .cse179 256))) (or (not (<= (mod (+ .cse178 .cse7) 256) 127)) (<= (mod (+ (* .cse178 255) .cse7 .cse179) 256) 127) (<= .cse180 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse181 .cse180) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod .cse178 256) 127)) (<= .cse182 127) (= .cse178 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse183 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse187 (mod (+ .cse183 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse185 (+ (- 256) .cse187))) (let ((.cse186 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse185))) (let ((.cse184 (mod .cse186 256))) (or (not (<= (mod (+ .cse183 .cse7) 256) 127)) (<= .cse184 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse185 .cse184) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ (* .cse183 255) .cse7 .cse186) 256) 127)) (not (<= (mod .cse183 256) 127)) (<= .cse187 127) (= .cse183 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))))) (or .cse38 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse189 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse188 (mod (+ .cse189 .cse7) 256))) (let ((.cse190 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse188) 256))) (or (not (<= .cse188 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse188 0) (<= (mod .cse189 256) 127) (<= (mod (+ .cse189 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= .cse190 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse188 .cse190) 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 ((.cse191 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse195 (mod .cse191 256))) (let ((.cse192 (+ (- 256) .cse195))) (let ((.cse194 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse192))) (let ((.cse193 (mod .cse194 256))) (or (not (<= (mod (+ .cse191 .cse7) 256) 127)) (not (= (mod (mod .cse192 .cse193) 256) 0)) (not (<= (mod (+ (* .cse191 255) .cse194) 256) 127)) (<= .cse195 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse193 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse191 |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| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse196 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse199 (mod .cse196 256))) (let ((.cse197 (+ (- 256) .cse199))) (let ((.cse200 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse197))) (let ((.cse198 (mod .cse200 256))) (or (not (<= (mod (+ .cse196 .cse7) 256) 127)) (not (= (mod (mod .cse197 .cse198) 256) 0)) (<= .cse199 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse198 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse196 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= (mod (+ (* .cse196 255) .cse200) 256) 127)))))))))))) (or .cse3 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse203 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse202 (mod (+ .cse203 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse201 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse202) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse201 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse202 127)) (<= (mod (+ .cse203 .cse7) 256) 127) (<= (mod .cse203 256) 127) (= 0 .cse202) (not (= (mod (mod .cse202 .cse201) 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 ((.cse206 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse207 (mod .cse206 256))) (let ((.cse204 (+ (- 256) .cse207))) (let ((.cse208 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse204))) (let ((.cse205 (mod .cse208 256))) (or (not (= (mod (mod .cse204 .cse205) 256) 0)) (not (<= (mod (+ .cse206 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse206 .cse7) 256) 127) (<= .cse207 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse205 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ (* .cse206 255) .cse208) 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 ((.cse211 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse212 (mod .cse211 256))) (let ((.cse209 (+ (- 256) .cse212))) (let ((.cse213 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse209))) (let ((.cse210 (mod .cse213 256))) (or (not (= (mod (mod .cse209 .cse210) 256) 0)) (not (<= (mod (+ .cse211 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse211 .cse7) 256) 127) (<= .cse212 127) (< 127 (mod (+ (* .cse211 255) .cse213) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse210 |c_ULTIMATE.start_main1_~y~0#1|))))))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127)) is different from true [2022-12-14 15:24:33,971 WARN L233 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 152 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:25:04,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 139 [2022-12-14 15:25:04,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:25:04,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=56, Invalid=171, Unknown=7, NotChecked=186, Total=420 [2022-12-14 15:25:04,139 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:04,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2022-12-14 15:25:04,145 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 15:25:04,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:25:04,343 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_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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:625) 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-12-14 15:25:04,351 INFO L158 Benchmark]: Toolchain (without parser) took 388341.69ms. Allocated memory is still 174.1MB. Free memory was 133.4MB in the beginning and 93.4MB in the end (delta: 40.0MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2022-12-14 15:25:04,352 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 119.5MB. Free memory was 93.7MB in the beginning and 93.5MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 15:25:04,353 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.32ms. Allocated memory is still 174.1MB. Free memory was 133.4MB in the beginning and 122.1MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-14 15:25:04,354 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.29ms. Allocated memory is still 174.1MB. Free memory was 122.1MB in the beginning and 120.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:25:04,355 INFO L158 Benchmark]: Boogie Preprocessor took 21.42ms. Allocated memory is still 174.1MB. Free memory was 120.0MB in the beginning and 118.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 15:25:04,356 INFO L158 Benchmark]: RCFGBuilder took 299.03ms. Allocated memory is still 174.1MB. Free memory was 118.7MB in the beginning and 103.3MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 15:25:04,357 INFO L158 Benchmark]: TraceAbstraction took 387757.69ms. Allocated memory is still 174.1MB. Free memory was 102.6MB in the beginning and 93.4MB in the end (delta: 9.2MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2022-12-14 15:25:04,359 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.17ms. Allocated memory is still 119.5MB. Free memory was 93.7MB in the beginning and 93.5MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.32ms. Allocated memory is still 174.1MB. Free memory was 133.4MB in the beginning and 122.1MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.29ms. Allocated memory is still 174.1MB. Free memory was 122.1MB in the beginning and 120.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.42ms. Allocated memory is still 174.1MB. Free memory was 120.0MB in the beginning and 118.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 299.03ms. Allocated memory is still 174.1MB. Free memory was 118.7MB in the beginning and 103.3MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 387757.69ms. Allocated memory is still 174.1MB. Free memory was 102.6MB in the beginning and 93.4MB in the end (delta: 9.2MB). Peak memory consumption was 10.8MB. 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_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_8.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh --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 3c398287975b44a672accc5dcc25b28e536e19f2a0478c0e2a0b4b73bd7a8e18 --- 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-2329fc7 [2022-12-14 15:25:05,685 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:25:05,687 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:25:05,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:25:05,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:25:05,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:25:05,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:25:05,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:25:05,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:25:05,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:25:05,705 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:25:05,706 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:25:05,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:25:05,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:25:05,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:25:05,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:25:05,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:25:05,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:25:05,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:25:05,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:25:05,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:25:05,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:25:05,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:25:05,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:25:05,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:25:05,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:25:05,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:25:05,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:25:05,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:25:05,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:25:05,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:25:05,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:25:05,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:25:05,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:25:05,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:25:05,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:25:05,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:25:05,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:25:05,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:25:05,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:25:05,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:25:05,731 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-12-14 15:25:05,747 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:25:05,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:25:05,747 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:25:05,748 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:25:05,748 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:25:05,748 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:25:05,748 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:25:05,748 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:25:05,749 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:25:05,749 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:25:05,749 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:25:05,749 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:25:05,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:25:05,749 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 15:25:05,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 15:25:05,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:25:05,750 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 15:25:05,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:25:05,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 15:25:05,750 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 15:25:05,750 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 15:25:05,750 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 15:25:05,751 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 15:25:05,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 15:25:05,751 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:25:05,751 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 15:25:05,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:25:05,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 15:25:05,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:25:05,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:25:05,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:25:05,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:25:05,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 15:25:05,752 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 15:25:05,752 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 15:25:05,752 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 15:25:05,752 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:25:05,752 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 15:25:05,752 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_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh 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 -> 3c398287975b44a672accc5dcc25b28e536e19f2a0478c0e2a0b4b73bd7a8e18 [2022-12-14 15:25:05,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:25:06,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:25:06,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:25:06,008 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:25:06,009 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:25:06,010 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/combinations/gcd_2+newton_2_8.i [2022-12-14 15:25:08,586 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:25:08,734 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:25:08,734 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i [2022-12-14 15:25:08,739 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/data/58bc69f49/dd3ccdaf25fe4468bdc8d6766284c3b1/FLAG79964f609 [2022-12-14 15:25:08,750 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/data/58bc69f49/dd3ccdaf25fe4468bdc8d6766284c3b1 [2022-12-14 15:25:08,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:25:08,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:25:08,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:25:08,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:25:08,757 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:25:08,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:25:08" (1/1) ... [2022-12-14 15:25:08,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f86fe97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:25:08, skipping insertion in model container [2022-12-14 15:25:08,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:25:08" (1/1) ... [2022-12-14 15:25:08,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:25:08,776 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:25:08,888 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_dbcd616d-c2f3-4373-8697-acc9094ef238/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i[1226,1239] [2022-12-14 15:25:08,906 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_dbcd616d-c2f3-4373-8697-acc9094ef238/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i[2841,2854] [2022-12-14 15:25:08,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:25:08,917 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 15:25:08,927 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_dbcd616d-c2f3-4373-8697-acc9094ef238/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i[1226,1239] [2022-12-14 15:25:08,934 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_dbcd616d-c2f3-4373-8697-acc9094ef238/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i[2841,2854] [2022-12-14 15:25:08,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:25:08,947 INFO L208 MainTranslator]: Completed translation [2022-12-14 15:25:08,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:25:08 WrapperNode [2022-12-14 15:25:08,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:25:08,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 15:25:08,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 15:25:08,948 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 15:25:08,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:25:08" (1/1) ... [2022-12-14 15:25:08,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:25:08" (1/1) ... [2022-12-14 15:25:08,977 INFO L138 Inliner]: procedures = 28, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 80 [2022-12-14 15:25:08,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 15:25:08,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 15:25:08,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 15:25:08,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 15:25:08,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:25:08" (1/1) ... [2022-12-14 15:25:08,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:25:08" (1/1) ... [2022-12-14 15:25:08,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:25:08" (1/1) ... [2022-12-14 15:25:08,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:25:08" (1/1) ... [2022-12-14 15:25:08,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:25:08" (1/1) ... [2022-12-14 15:25:08,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:25:08" (1/1) ... [2022-12-14 15:25:08,997 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:25:08" (1/1) ... [2022-12-14 15:25:08,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:25:08" (1/1) ... [2022-12-14 15:25:09,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 15:25:09,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 15:25:09,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 15:25:09,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 15:25:09,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:25:08" (1/1) ... [2022-12-14 15:25:09,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:25:09,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:25:09,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 15:25:09,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 15:25:09,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 15:25:09,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 15:25:09,060 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-12-14 15:25:09,060 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-12-14 15:25:09,060 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-12-14 15:25:09,060 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-12-14 15:25:09,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 15:25:09,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 15:25:09,129 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 15:25:09,131 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 15:25:17,798 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 15:25:17,803 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 15:25:17,804 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 15:25:17,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:25:17 BoogieIcfgContainer [2022-12-14 15:25:17,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 15:25:17,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 15:25:17,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 15:25:17,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 15:25:17,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:25:08" (1/3) ... [2022-12-14 15:25:17,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f18e596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:25:17, skipping insertion in model container [2022-12-14 15:25:17,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:25:08" (2/3) ... [2022-12-14 15:25:17,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f18e596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:25:17, skipping insertion in model container [2022-12-14 15:25:17,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:25:17" (3/3) ... [2022-12-14 15:25:17,813 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_8.i [2022-12-14 15:25:17,827 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 15:25:17,827 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-14 15:25:17,860 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 15:25:17,865 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;@3532d468, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 15:25:17,865 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-14 15:25:17,868 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-12-14 15:25:17,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 15:25:17,873 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:17,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:17,874 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:25:17,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:17,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-12-14 15:25:17,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:25:17,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90859734] [2022-12-14 15:25:17,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:17,887 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-12-14 15:25:17,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:25:17,889 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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-12-14 15:25:17,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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-12-14 15:25:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:17,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:25:17,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:18,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:25:18,068 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:25:18,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90859734] [2022-12-14 15:25:18,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90859734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:18,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:18,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:25:18,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52794191] [2022-12-14 15:25:18,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:18,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:25:18,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:25:18,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:25:18,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:25:18,096 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-12-14 15:25:18,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:18,168 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2022-12-14 15:25:18,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:25:18,170 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-12-14 15:25:18,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:18,175 INFO L225 Difference]: With dead ends: 68 [2022-12-14 15:25:18,175 INFO L226 Difference]: Without dead ends: 30 [2022-12-14 15:25:18,177 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-12-14 15:25:18,179 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:18,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:25:18,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-12-14 15:25:18,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-12-14 15:25:18,204 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-12-14 15:25:18,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-12-14 15:25:18,205 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2022-12-14 15:25:18,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:18,206 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-12-14 15:25:18,206 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-12-14 15:25:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-12-14 15:25:18,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 15:25:18,207 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:18,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:18,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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-12-14 15:25:18,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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-12-14 15:25:18,409 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:25:18,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:18,411 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2022-12-14 15:25:18,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:25:18,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229364715] [2022-12-14 15:25:18,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:18,414 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-12-14 15:25:18,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:25:18,417 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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-12-14 15:25:18,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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-12-14 15:25:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:18,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:25:18,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:18,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:25:18,643 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:25:18,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229364715] [2022-12-14 15:25:18,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229364715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:18,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:18,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:25:18,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436013807] [2022-12-14 15:25:18,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:18,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:25:18,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:25:18,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:25:18,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:25:18,647 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-12-14 15:25:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:18,807 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-12-14 15:25:18,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:25:18,808 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-12-14 15:25:18,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:18,809 INFO L225 Difference]: With dead ends: 37 [2022-12-14 15:25:18,809 INFO L226 Difference]: Without dead ends: 31 [2022-12-14 15:25:18,809 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-12-14 15:25:18,810 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-12-14 15:25:18,811 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-12-14 15:25:18,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-14 15:25:18,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-12-14 15:25:18,816 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-12-14 15:25:18,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-12-14 15:25:18,817 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2022-12-14 15:25:18,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:18,818 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-12-14 15:25:18,818 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-12-14 15:25:18,818 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-12-14 15:25:18,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 15:25:18,819 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:18,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:18,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 15:25:19,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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-12-14 15:25:19,021 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:25:19,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:19,023 INFO L85 PathProgramCache]: Analyzing trace with hash 149955676, now seen corresponding path program 1 times [2022-12-14 15:25:19,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:25:19,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045501063] [2022-12-14 15:25:19,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:19,026 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-12-14 15:25:19,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:25:19,028 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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-12-14 15:25:19,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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-12-14 15:25:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:19,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:25:19,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:19,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:25:19,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:25:19,205 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:25:19,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045501063] [2022-12-14 15:25:19,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045501063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:19,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:19,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:25:19,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228855397] [2022-12-14 15:25:19,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:19,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:25:19,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:25:19,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:25:19,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:25:19,207 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-12-14 15:25:19,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:19,295 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-12-14 15:25:19,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:25:19,296 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-12-14 15:25:19,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:19,296 INFO L225 Difference]: With dead ends: 38 [2022-12-14 15:25:19,296 INFO L226 Difference]: Without dead ends: 30 [2022-12-14 15:25:19,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:25:19,297 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-12-14 15:25:19,298 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-12-14 15:25:19,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-12-14 15:25:19,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-12-14 15:25:19,301 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-12-14 15:25:19,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-12-14 15:25:19,302 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 12 [2022-12-14 15:25:19,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:19,302 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-12-14 15:25:19,302 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-12-14 15:25:19,302 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-12-14 15:25:19,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 15:25:19,302 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:19,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:19,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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)] Forceful destruction successful, exit code 0 [2022-12-14 15:25:19,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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-12-14 15:25:19,505 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:25:19,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:19,506 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2022-12-14 15:25:19,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:25:19,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471078088] [2022-12-14 15:25:19,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:19,508 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-12-14 15:25:19,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:25:19,511 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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-12-14 15:25:19,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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-12-14 15:25:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:19,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 15:25:19,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:20,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:20,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:25:20,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:20,648 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:25:20,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471078088] [2022-12-14 15:25:20,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471078088] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:25:20,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1348910802] [2022-12-14 15:25:20,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:20,649 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 15:25:20,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 15:25:20,650 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 15:25:20,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-12-14 15:25:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:20,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 15:25:20,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:20,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:20,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:25:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:21,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1348910802] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:25:21,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92332991] [2022-12-14 15:25:21,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:21,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:25:21,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:25:21,086 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:25:21,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 15:25:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:21,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-14 15:25:21,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:21,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:21,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:25:21,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:21,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92332991] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:25:21,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 15:25:21,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 7] total 18 [2022-12-14 15:25:21,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397694724] [2022-12-14 15:25:21,953 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 15:25:21,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 15:25:21,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:25:21,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 15:25:21,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-12-14 15:25:21,954 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-12-14 15:25:25,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:25,361 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-12-14 15:25:25,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 15:25:25,362 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-12-14 15:25:25,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:25,362 INFO L225 Difference]: With dead ends: 43 [2022-12-14 15:25:25,362 INFO L226 Difference]: Without dead ends: 20 [2022-12-14 15:25:25,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=248, Invalid=744, Unknown=0, NotChecked=0, Total=992 [2022-12-14 15:25:25,363 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 63 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:25,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 159 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 15:25:25,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-12-14 15:25:25,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-12-14 15:25:25,366 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-12-14 15:25:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-12-14 15:25:25,366 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2022-12-14 15:25:25,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:25,367 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-12-14 15:25:25,367 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-12-14 15:25:25,367 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-12-14 15:25:25,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 15:25:25,367 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:25,367 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-12-14 15:25:25,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 15:25:25,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2022-12-14 15:25:25,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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)] Forceful destruction successful, exit code 0 [2022-12-14 15:25:25,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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-12-14 15:25:25,970 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 15:25:25,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:25,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1535073882, now seen corresponding path program 1 times [2022-12-14 15:25:25,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:25:25,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959883834] [2022-12-14 15:25:25,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:25,972 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-12-14 15:25:25,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:25:25,973 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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-12-14 15:25:25,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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-12-14 15:25:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 15:25:43,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 15:32:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 15:32:32,916 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-12-14 15:32:32,916 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 15:32:32,917 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-14 15:32:32,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-12-14 15:32:32,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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)] Forceful destruction successful, exit code 0 [2022-12-14 15:32:33,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/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-12-14 15:32:33,129 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-12-14 15:32:33,139 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 15:32:33,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 03:32:33 BoogieIcfgContainer [2022-12-14 15:32:33,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 15:32:33,169 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 15:32:33,169 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 15:32:33,169 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 15:32:33,169 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:25:17" (3/4) ... [2022-12-14 15:32:33,171 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 15:32:33,196 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 15:32:33,196 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 15:32:33,197 INFO L158 Benchmark]: Toolchain (without parser) took 444443.48ms. Allocated memory is still 83.9MB. Free memory was 62.5MB in the beginning and 38.1MB in the end (delta: 24.4MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2022-12-14 15:32:33,197 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 62.9MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 15:32:33,197 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.26ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 50.4MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-14 15:32:33,198 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.85ms. Allocated memory is still 83.9MB. Free memory was 50.2MB in the beginning and 48.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:32:33,198 INFO L158 Benchmark]: Boogie Preprocessor took 22.36ms. Allocated memory is still 83.9MB. Free memory was 48.5MB in the beginning and 46.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:32:33,198 INFO L158 Benchmark]: RCFGBuilder took 8804.59ms. Allocated memory is still 83.9MB. Free memory was 46.9MB in the beginning and 55.3MB in the end (delta: -8.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-14 15:32:33,199 INFO L158 Benchmark]: TraceAbstraction took 435361.33ms. Allocated memory is still 83.9MB. Free memory was 55.0MB in the beginning and 40.2MB in the end (delta: 14.8MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2022-12-14 15:32:33,199 INFO L158 Benchmark]: Witness Printer took 27.23ms. Allocated memory is still 83.9MB. Free memory was 40.2MB in the beginning and 38.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:32:33,200 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.16ms. Allocated memory is still 62.9MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.26ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 50.4MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.85ms. Allocated memory is still 83.9MB. Free memory was 50.2MB in the beginning and 48.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.36ms. Allocated memory is still 83.9MB. Free memory was 48.5MB in the beginning and 46.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 8804.59ms. Allocated memory is still 83.9MB. Free memory was 46.9MB in the beginning and 55.3MB in the end (delta: -8.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 435361.33ms. Allocated memory is still 83.9MB. Free memory was 55.0MB in the beginning and 40.2MB in the end (delta: 14.8MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Witness Printer took 27.23ms. Allocated memory is still 83.9MB. Free memory was 40.2MB in the beginning and 38.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 102]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L108] COND FALSE !(__VERIFIER_nondet_int()) [L111] CALL main2() [L90] float IN = __VERIFIER_nondet_float(); [L91] CALL assume_abort_if_not(IN > -2.0f && IN < 2.0f) [L75] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L91] RET assume_abort_if_not(IN > -2.0f && IN < 2.0f) [L93] CALL, EXPR f(IN) VAL [\old(x)=1.7085765600204468] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=1.7085765600204468, \result=1.0070574283599854, x=1.7085765600204468] [L93] RET, EXPR f(IN) VAL [f(IN)=1.0070574283599854, IN=1.7085765600204468] [L93] CALL, EXPR fp(IN) VAL [\old(x)=1.7085765600204468] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=1.7085765600204468, \result=-0.06998457759618759, x=1.7085765600204468] [L93] RET, EXPR fp(IN) VAL [f(IN)=1.0070574283599854, fp(IN)=-0.06998457759618759, IN=1.7085765600204468] [L93] float x = IN - f(IN)/fp(IN); [L95] CALL, EXPR f(x) VAL [\old(x)=16.098281860351562] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=16.098281860351562, \result=63924.37890625, x=16.098281860351562] [L95] RET, EXPR f(x) VAL [f(x)=63924.37890625, IN=1.7085765600204468, x=16.098281860351562] [L95] CALL, EXPR fp(x) VAL [\old(x)=16.098281860351562] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=16.098281860351562, \result=26843.58984375, x=16.098281860351562] [L95] RET, EXPR fp(x) VAL [f(x)=63924.37890625, fp(x)=26843.58984375, IN=1.7085765600204468, x=16.098281860351562] [L95] x = x - f(x)/fp(x) [L101] COND TRUE !(x < 0.1) VAL [IN=1.7085765600204468, x=13.716917037963867] [L102] reach_error() VAL [IN=1.7085765600204468, x=13.716917037963867] - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 37 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 435.3s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 407 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 280 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 127 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 18.0s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 95 NumberOfCodeBlocks, 95 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 97 ConstructedInterpolants, 1 QuantifiedInterpolants, 435 SizeOfPredicates, 27 NumberOfNonLiveVariables, 258 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 1/7 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-14 15:32:33,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dbcd616d-c2f3-4373-8697-acc9094ef238/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE