./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_2_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI --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 edf451b08ccf28b9358a6fa7c10128ea1b9a8f09b01361f9cd588dc4a31f271a --- 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-5e519f3 [2022-11-03 02:10:29,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:10:29,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:10:29,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:10:29,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:10:29,998 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:10:30,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:10:30,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:10:30,012 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:10:30,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:10:30,022 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:10:30,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:10:30,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:10:30,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:10:30,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:10:30,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:10:30,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:10:30,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:10:30,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:10:30,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:10:30,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:10:30,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:10:30,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:10:30,060 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:10:30,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:10:30,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:10:30,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:10:30,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:10:30,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:10:30,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:10:30,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:10:30,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:10:30,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:10:30,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:10:30,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:10:30,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:10:30,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:10:30,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:10:30,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:10:30,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:10:30,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:10:30,094 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:10:30,148 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:10:30,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:10:30,150 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:10:30,150 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:10:30,151 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:10:30,152 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:10:30,152 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:10:30,152 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:10:30,153 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:10:30,153 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:10:30,154 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:10:30,155 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:10:30,155 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:10:30,155 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:10:30,156 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:10:30,156 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:10:30,156 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:10:30,156 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:10:30,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:10:30,158 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:10:30,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:10:30,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:10:30,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:10:30,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:10:30,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:10:30,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:10:30,161 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:10:30,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:10:30,162 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:10:30,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:10:30,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:10:30,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:10:30,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:10:30,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:10:30,164 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:10:30,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:10:30,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:10:30,165 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:10:30,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:10:30,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:10:30,166 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:10:30,166 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_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/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_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI 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 -> edf451b08ccf28b9358a6fa7c10128ea1b9a8f09b01361f9cd588dc4a31f271a [2022-11-03 02:10:30,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:10:30,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:10:30,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:10:30,651 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:10:30,653 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:10:30,654 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/combinations/gcd_2+newton_2_2.i [2022-11-03 02:10:30,760 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/data/f5148d7f1/a2cc5b4a636b4d3086f0e10092ddb9c8/FLAGe6682d54a [2022-11-03 02:10:31,409 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:10:31,415 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i [2022-11-03 02:10:31,427 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/data/f5148d7f1/a2cc5b4a636b4d3086f0e10092ddb9c8/FLAGe6682d54a [2022-11-03 02:10:31,737 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/data/f5148d7f1/a2cc5b4a636b4d3086f0e10092ddb9c8 [2022-11-03 02:10:31,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:10:31,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:10:31,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:10:31,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:10:31,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:10:31,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:10:31" (1/1) ... [2022-11-03 02:10:31,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b25951d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:31, skipping insertion in model container [2022-11-03 02:10:31,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:10:31" (1/1) ... [2022-11-03 02:10:31,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:10:31,802 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:10:32,119 WARN L230 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_7d34f1fe-107c-4eea-8cec-54c61f7036f4/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[1226,1239] [2022-11-03 02:10:32,149 WARN L230 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_7d34f1fe-107c-4eea-8cec-54c61f7036f4/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[2841,2854] [2022-11-03 02:10:32,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:10:32,169 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:10:32,185 WARN L230 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_7d34f1fe-107c-4eea-8cec-54c61f7036f4/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[1226,1239] [2022-11-03 02:10:32,224 WARN L230 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_7d34f1fe-107c-4eea-8cec-54c61f7036f4/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[2841,2854] [2022-11-03 02:10:32,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:10:32,257 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:10:32,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:32 WrapperNode [2022-11-03 02:10:32,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:10:32,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:10:32,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:10:32,260 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:10:32,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:32" (1/1) ... [2022-11-03 02:10:32,281 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:32" (1/1) ... [2022-11-03 02:10:32,309 INFO L138 Inliner]: procedures = 27, calls = 16, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 77 [2022-11-03 02:10:32,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:10:32,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:10:32,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:10:32,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:10:32,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:32" (1/1) ... [2022-11-03 02:10:32,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:32" (1/1) ... [2022-11-03 02:10:32,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:32" (1/1) ... [2022-11-03 02:10:32,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:32" (1/1) ... [2022-11-03 02:10:32,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:32" (1/1) ... [2022-11-03 02:10:32,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:32" (1/1) ... [2022-11-03 02:10:32,340 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:32" (1/1) ... [2022-11-03 02:10:32,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:32" (1/1) ... [2022-11-03 02:10:32,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:10:32,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:10:32,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:10:32,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:10:32,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:32" (1/1) ... [2022-11-03 02:10:32,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:10:32,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:10:32,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:10:32,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:10:32,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:10:32,446 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-03 02:10:32,447 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-03 02:10:32,447 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-03 02:10:32,447 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-03 02:10:32,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:10:32,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:10:32,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:10:32,542 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:10:32,545 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:10:32,889 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:10:33,042 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:10:33,043 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 02:10:33,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:10:33 BoogieIcfgContainer [2022-11-03 02:10:33,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:10:33,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:10:33,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:10:33,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:10:33,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:10:31" (1/3) ... [2022-11-03 02:10:33,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630f8071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:10:33, skipping insertion in model container [2022-11-03 02:10:33,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:10:32" (2/3) ... [2022-11-03 02:10:33,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630f8071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:10:33, skipping insertion in model container [2022-11-03 02:10:33,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:10:33" (3/3) ... [2022-11-03 02:10:33,074 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_2.i [2022-11-03 02:10:33,107 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:10:33,108 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-03 02:10:33,190 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:10:33,203 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;@4bd0aa86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:10:33,203 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-03 02:10:33,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 02:10:33,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 02:10:33,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:10:33,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 02:10:33,224 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:10:33,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:10:33,234 INFO L85 PathProgramCache]: Analyzing trace with hash -499021812, now seen corresponding path program 1 times [2022-11-03 02:10:33,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:10:33,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561133831] [2022-11-03 02:10:33,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:33,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:10:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:10:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:10:33,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:10:33,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561133831] [2022-11-03 02:10:33,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561133831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:10:33,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:10:33,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:10:33,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226168722] [2022-11-03 02:10:33,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:10:33,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:10:33,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:10:33,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:10:33,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:10:33,886 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:34,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:10:34,041 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-11-03 02:10:34,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:10:34,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-03 02:10:34,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:10:34,058 INFO L225 Difference]: With dead ends: 38 [2022-11-03 02:10:34,058 INFO L226 Difference]: Without dead ends: 21 [2022-11-03 02:10:34,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:10:34,077 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:10:34,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 35 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:10:34,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-03 02:10:34,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-03 02:10:34,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 02:10:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-11-03 02:10:34,150 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 6 [2022-11-03 02:10:34,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:10:34,151 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-11-03 02:10:34,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-11-03 02:10:34,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 02:10:34,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:10:34,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:10:34,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:10:34,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:10:34,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:10:34,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1643785969, now seen corresponding path program 1 times [2022-11-03 02:10:34,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:10:34,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471437144] [2022-11-03 02:10:34,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:34,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:10:34,208 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:10:34,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [370654883] [2022-11-03 02:10:34,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:34,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:10:34,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:10:34,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:10:34,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:10:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:10:34,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 02:10:34,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:10:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:10:34,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:10:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:10:35,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:10:35,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471437144] [2022-11-03 02:10:35,113 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:10:35,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370654883] [2022-11-03 02:10:35,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370654883] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:10:35,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [798195787] [2022-11-03 02:10:35,147 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:10:35,148 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:10:35,154 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:10:35,166 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:10:35,167 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:10:35,498 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:10:35,977 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '159#(and (= |ULTIMATE.start_gcd_test_~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (<= |ULTIMATE.start_gcd_test_#in~a#1| 127) (<= |ULTIMATE.start_main1_~x~0#1| 127) (<= |ULTIMATE.start_gcd_test_#in~b#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (< 0 |ULTIMATE.start_main1_~y~0#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (ite (<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~y~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 (+ |ULTIMATE.start_main1_~x~0#1| 128)) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_#res#1|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:10:35,977 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:10:35,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:10:35,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-11-03 02:10:35,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203144534] [2022-11-03 02:10:35,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:10:35,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:10:35,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:10:35,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:10:35,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:10:35,983 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:10:36,332 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-11-03 02:10:36,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:10:36,333 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 7 [2022-11-03 02:10:36,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:10:36,334 INFO L225 Difference]: With dead ends: 28 [2022-11-03 02:10:36,334 INFO L226 Difference]: Without dead ends: 23 [2022-11-03 02:10:36,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:10:36,337 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:10:36,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 95 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:10:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-03 02:10:36,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-03 02:10:36,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 02:10:36,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-11-03 02:10:36,346 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 7 [2022-11-03 02:10:36,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:10:36,347 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-11-03 02:10:36,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:36,347 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-11-03 02:10:36,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 02:10:36,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:10:36,348 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2022-11-03 02:10:36,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-03 02:10:36,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:10:36,575 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:10:36,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:10:36,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1300293201, now seen corresponding path program 2 times [2022-11-03 02:10:36,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:10:36,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306298589] [2022-11-03 02:10:36,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:36,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:10:36,591 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:10:36,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2085306244] [2022-11-03 02:10:36,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:10:36,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:10:36,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:10:36,594 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:10:36,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:10:36,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:10:36,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:10:36,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 02:10:36,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:10:44,333 WARN L234 SmtUtils]: Spent 5.38s on a formula simplification. DAG size of input: 109 DAG size of output: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:11:01,974 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse41 (< |c_ULTIMATE.start_main1_~y~0#1| 0)) (.cse40 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (and (let ((.cse4 (mod .cse40 256))) (let ((.cse26 (<= .cse4 127))) (or (and (let ((.cse2 (* .cse4 255))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (let ((.cse0 (mod .cse3 256))) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse0))) (and (not (<= (mod (+ (* 255 .cse0) .cse1) 256) 127)) (not (<= (mod (+ .cse2 .cse3) 256) 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (<= .cse0 127) (= .cse1 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse1 256))))))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse6 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4) 256))) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse6)))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= (mod .cse5 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= .cse5 0) (not (<= (mod (+ .cse5 .cse6) 256) 127)))))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (let ((.cse8 (mod (+ .cse2 .cse9) 256))) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse8)))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse7 256)) (not (<= (mod (+ .cse8 .cse7) 256) 127)) (= .cse7 0) (<= (mod .cse9 256) 127) (not (= .cse9 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse10 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4) 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse10)) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (<= .cse10 127))))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (let ((.cse11 (mod .cse13 256))) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse11))) (and (not (<= (mod (+ (* 255 .cse11) .cse12) 256) 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (<= (mod (+ .cse2 .cse13) 256) 127) (= .cse12 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse12 256))))))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (let ((.cse15 (mod .cse14 256))) (and (not (<= (mod (+ .cse2 .cse14) 256) 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse15 0)) (<= .cse15 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse15) 256)))))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) (mod (+ .cse2 .cse16) 256))) 256)) (not (<= (mod .cse16 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse17 (mod (+ .cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4)) 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse17) 256)) (not (= .cse17 0)) (<= .cse17 127) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (let ((.cse18 (mod (+ .cse2 .cse19) 256))) (and (not (<= .cse18 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse18)) 256)) (<= (mod .cse19 256) 127) (not (= .cse19 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) (mod (+ .cse2 .cse21) 256))))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse20 256)) (= .cse20 0) (not (<= (mod .cse21 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse23 (mod (+ .cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4)) 256))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse23))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse22 256)) (not (= .cse23 0)) (= .cse22 0) (<= .cse23 127) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (let ((.cse24 (mod .cse25 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse24 0)) (<= (mod (+ .cse2 .cse25) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse24) 256)))))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) .cse26) (and (let ((.cse33 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse29 (+ .cse4 (- 256)))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse29))) (and (not (= .cse27 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) (mod (+ .cse27 .cse4) 256))))) (and (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= .cse28 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse28 256))))) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse30 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse29) 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse30) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (not (= .cse30 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse31 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse29) 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse31))) (and (= (mod (+ (* 255 .cse31) .cse32) 256) .cse33) (not (= .cse32 0)) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (not (= .cse31 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse29))) (and (not (= .cse34 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) (mod (+ .cse34 .cse4) 256))) 256)))) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse29) 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse36))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse35 256)) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= .cse35 0)))) (not (= .cse36 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse29))) (and (not (= .cse37 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse39 (mod (+ .cse37 .cse4) 256))) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse39)))) (and (= (mod (+ .cse38 .cse39) 256) .cse33) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (not (= .cse38 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0))))) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (not .cse26))))) .cse41) (and (not .cse41) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse42 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) (mod (+ .cse43 .cse40) 256))))) (and (= (mod .cse42 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (<= (mod .cse43 256) 127)) (= .cse42 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse46 (mod (+ .cse44 .cse40) 256))) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse46)))) (and (not (= .cse44 0)) (<= (mod .cse44 256) 127) (= (mod .cse45 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (<= .cse46 127)) (= .cse45 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse48 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse48)))) (and (= .cse47 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse47 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (<= (mod (+ .cse47 .cse48) 256) 127)))))) (<= |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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse49 (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) .cse40) 256))) (let ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse49))) (and (<= .cse49 127) (= .cse50 0) (not (<= (mod (+ (* 255 .cse49) .cse50) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse50 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) (mod (+ .cse51 .cse40) 256))) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (<= (mod .cse51 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse52 (mod .cse53 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse52) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse52 127) (not (<= (mod (+ .cse53 .cse40) 256) 127)) (not (= .cse52 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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse54 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse54)) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (<= .cse54 127))))) (<= |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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse55 (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) .cse40) 256))) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse55))) (let ((.cse57 (mod .cse56 256))) (and (<= .cse55 127) (not (<= (mod (+ (* 255 .cse55) .cse56) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse57) (<= .cse57 127) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse58 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse59 (mod (+ .cse58 .cse40) 256))) (and (not (= .cse58 0)) (<= (mod .cse58 256) 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse59)) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (<= .cse59 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse62 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse61 (mod .cse62 256))) (let ((.cse60 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse61))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= (mod .cse60 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse61 127) (not (<= (mod (+ .cse62 .cse40) 256) 127)) (= .cse60 0) (not (= .cse61 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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse63 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse64 (mod .cse63 256))) (and (<= (mod (+ .cse63 .cse40) 256) 127) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse64) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse64 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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse65 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse67 (mod .cse65 256))) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse67))) (and (<= (mod (+ .cse65 .cse40) 256) 127) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= (mod .cse66 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= .cse66 0) (not (= .cse67 0))))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127)) is different from false [2022-11-03 02:15:53,040 WARN L234 SmtUtils]: Spent 4.67m on a formula simplification. DAG size of input: 241 DAG size of output: 222 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:16:05,529 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse32 (< |c_ULTIMATE.start_main1_~y~0#1| 0)) (.cse31 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (and (let ((.cse4 (mod .cse31 256))) (let ((.cse17 (<= .cse4 127))) (or (and (let ((.cse0 (* .cse4 255))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (let ((.cse2 (mod .cse1 256))) (let ((.cse3 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse2) 256))) (and (not (<= (mod (+ .cse0 .cse1) 256) 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse2 0)) (not (= .cse3 0)) (<= .cse2 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse3) 256) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse3) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse6 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4) 256))) (let ((.cse5 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse6)) 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse5) 256) 0) (not (= .cse5 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse5) (not (<= .cse6 127)) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (let ((.cse7 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) (mod (+ .cse0 .cse8) 256))) 256))) (and (<= |c_ULTIMATE.start_main1_~g~0#1| .cse7) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse7) 256) 0) (not (= .cse7 0)) (not (<= (mod .cse8 256) 127)) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (let ((.cse10 (mod (+ .cse0 .cse11) 256))) (let ((.cse9 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse10)) 256))) (and (<= |c_ULTIMATE.start_main1_~g~0#1| .cse9) (not (<= .cse10 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse9) 256) 0) (<= (mod .cse11 256) 127) (not (= .cse9 0)) (not (= .cse11 0)) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse12 (mod (+ .cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4)) 256))) (let ((.cse13 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse12) 256))) (and (not (= .cse12 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse13) (not (= .cse13 0)) (<= .cse12 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse13) 256) 0) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (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| .cse4))) (let ((.cse14 (mod .cse16 256))) (let ((.cse15 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse14) 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse14 0)) (not (= .cse15 0)) (<= (mod (+ .cse0 .cse16) 256) 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse15) 256) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse15) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))))) .cse17) (and (not .cse17) (let ((.cse21 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse20 (+ .cse4 (- 256)))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse19 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse20) 256))) (let ((.cse18 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse19) 256))) (and (not (= .cse18 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse18) 256) 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse18) (not (= .cse19 0)))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse24 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse20) 256))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse24))) (let ((.cse22 (mod (+ (* 255 .cse24) .cse23) 256))) (and (<= .cse21 .cse22) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse23 0)) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ (- 256) .cse22)) 256) 0) (not (= .cse24 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse20))) (let ((.cse25 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) (mod (+ .cse26 .cse4) 256))) 256))) (and (not (= .cse25 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse25) 256) 0) (not (= .cse26 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse25) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse20))) (let ((.cse30 (mod (+ .cse27 .cse4) 256))) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse30)))) (let ((.cse28 (mod (+ .cse29 .cse30) 256))) (and (not (= .cse27 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ .cse28 (- 256))) 256) 0) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= .cse21 .cse28) (not (= .cse29 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))))))))) .cse32) (and (not .cse32) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|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|) .cse31) 256))) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse34))) (let ((.cse33 (mod .cse35 256))) (and (not (= .cse33 0)) (<= .cse34 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse33) 256) 0) (not (<= (mod (+ (* 255 .cse34) .cse35) 256) 127)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse33) (<= .cse33 127) (<= |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_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse37 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse37)) 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse36) 256) 0) (not (= .cse36 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse36) (not (<= .cse37 127)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse40 (mod (+ .cse39 .cse31) 256))) (let ((.cse38 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse40)) 256))) (and (<= |c_ULTIMATE.start_main1_~g~0#1| .cse38) (not (= .cse39 0)) (<= (mod .cse39 256) 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse38) 256) 0) (not (<= .cse40 127)) (not (= .cse38 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)))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse42 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse41 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) (mod (+ .cse42 .cse31) 256))) 256))) (and (<= |c_ULTIMATE.start_main1_~g~0#1| .cse41) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse41) 256) 0) (not (<= (mod .cse42 256) 127)) (not (= .cse41 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))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse44 (mod .cse45 256))) (let ((.cse43 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse44) 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse43) 256) 0) (<= .cse44 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse43) (not (= .cse43 0)) (not (<= (mod (+ .cse45 .cse31) 256) 127)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse44 0))))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse48 (mod .cse46 256))) (let ((.cse47 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse48) 256))) (and (<= (mod (+ .cse46 .cse31) 256) 127) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse47) 256) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse47) (not (= .cse47 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse48 0))))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127)) is different from false [2022-11-03 02:16:07,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 02:16:07,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:16:49,696 WARN L855 $PredicateComparison]: unable to prove that (or (let ((.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (let ((.cse7 (not .cse0)) (.cse2 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse4 (+ |c_ULTIMATE.start_main1_~y~0#1| 1))) (and (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse1 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse3 (mod .cse1 256))) (or (not (<= (mod (+ .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse1 .cse2) 256) 127) (<= .cse3 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| (+ (- 256) .cse3)) 256) .cse4))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse6 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse5 (mod (+ .cse6 .cse2) 256))) (or (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| (+ (- 256) .cse5)) 256) .cse4) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse6 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse5 127) (<= (mod .cse6 256) 127))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse8 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod .cse8 256))) (or (not (<= (mod (+ .cse8 .cse2) 256) 127)) (= .cse9 0) (not (<= (mod (+ .cse8 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (<= .cse9 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse9) 256) .cse4))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse10 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse11 (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not (<= (mod (+ .cse10 .cse2) 256) 127)) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse11) 256) .cse4) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse11 127)) (= 0 .cse11) (not (<= (mod .cse10 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (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))) (or (not (<= (mod (+ .cse12 .cse2) 256) 127)) (= .cse13 0) (not (<= .cse13 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse12 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse13) 256) .cse4))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (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 ((.cse14 (mod (+ .cse15 .cse2) 256))) (or (not (<= .cse14 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse14 0) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse14) 256) .cse4) (not (<= (mod .cse15 256) 127)) (<= (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse15 0))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse0) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse16 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod (+ .cse16 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not (<= (mod (+ .cse16 .cse2) 256) 127)) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse17) 256) .cse4) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse17 127)) (<= (mod .cse16 256) 127) (= 0 .cse17))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse19 (mod .cse18 256))) (or (not (<= (mod (+ .cse18 .cse2) 256) 127)) (not (<= (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse19 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| (+ (- 256) .cse19)) 256) .cse4))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse20 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse21 (mod .cse20 256))) (or (<= (mod (+ .cse20 .cse2) 256) 127) (<= .cse21 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| (+ (- 256) .cse21)) 256) .cse4))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse23 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod (+ .cse23 .cse2) 256))) (or (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| (+ (- 256) .cse22)) 256) .cse4) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse22 127) (<= (mod .cse23 256) 127) (<= (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse24 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod .cse24 256))) (or (not (<= (mod (+ .cse24 .cse2) 256) 127)) (<= .cse25 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse24 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| (+ (- 256) .cse25)) 256) .cse4))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|) (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 ((.cse26 (mod (+ .cse27 .cse2) 256))) (or (not (<= .cse26 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse26 0) (<= (mod .cse27 256) 127) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse26) 256) .cse4) (<= (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod (+ .cse29 .cse2) 256))) (or (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| (+ (- 256) .cse28)) 256) .cse4) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse28 127) (not (<= (mod .cse29 256) 127)) (= .cse29 0))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod .cse31 256))) (or (= .cse30 0) (not (<= (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse31 .cse2) 256) 127) (not (<= .cse30 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse30) 256) .cse4))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse32 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod (+ .cse32 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not (<= (mod (+ .cse32 .cse2) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| (+ (- 256) .cse33)) 256) .cse4) (not (<= (mod .cse32 256) 127)) (<= .cse33 127) (= .cse32 0))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse34 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse35 (mod .cse34 256))) (or (not (<= (mod (+ .cse34 .cse2) 256) 127)) (= .cse35 0) (not (<= .cse35 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse34 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse35) 256) .cse4))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse36 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse37 (mod .cse36 256))) (or (not (<= (mod (+ .cse36 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse36 .cse2) 256) 127) (<= .cse37 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| (+ (- 256) .cse37)) 256) .cse4))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse39 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse38) 256) .cse4) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse38 127)) (<= (mod (+ .cse39 .cse2) 256) 127) (<= (mod .cse39 256) 127) (= 0 .cse38))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse40 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse41 (mod .cse40 256))) (or (not (<= (mod (+ .cse40 .cse2) 256) 127)) (<= .cse41 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse40 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| (+ (- 256) .cse41)) 256) .cse4))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse43 (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not (<= (mod (+ .cse42 .cse2) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse42 256) 127) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| (+ (- 256) .cse43)) 256) .cse4) (<= .cse43 127))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse44 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse45 (mod .cse44 256))) (or (not (<= (mod (+ .cse44 .cse2) 256) 127)) (= .cse45 0) (not (<= (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (<= .cse45 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse45) 256) .cse4))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod (+ .cse47 .cse2) 256))) (or (not (<= .cse46 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse46 0) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse46) 256) .cse4) (not (<= (mod .cse47 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse0) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse49 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse48 (mod (+ .cse49 .cse2) 256))) (or (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| (+ (- 256) .cse48)) 256) .cse4) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse48 127) (not (<= (mod .cse49 256) 127)) (<= (mod (+ .cse49 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse49 0))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (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 ((.cse50 (mod .cse51 256))) (or (= .cse50 0) (<= (mod (+ .cse51 .cse2) 256) 127) (not (<= .cse50 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse50) 256) .cse4))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse0) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse53 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse52 (mod (+ .cse53 .cse2) 256))) (or (not (<= .cse52 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse53 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse52 0) (<= (mod .cse53 256) 127) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse52) 256) .cse4))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| |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 ((.cse55 (mod .cse54 256))) (or (not (<= (mod (+ .cse54 .cse2) 256) 127)) (not (<= (mod (+ .cse54 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse55 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| (+ (- 256) .cse55)) 256) .cse4))))))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| 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 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse56 .cse2) 256) 127) (<= (mod .cse56 256) 127) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| (+ (- 256) .cse57)) 256) .cse4) (<= .cse57 127))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse58 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse59 (mod .cse58 256))) (or (<= (mod (+ .cse58 .cse2) 256) 127) (<= .cse59 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse58 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| (+ (- 256) .cse59)) 256) .cse4))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse61 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse60 (mod .cse61 256))) (or (= .cse60 0) (not (<= (mod (+ .cse61 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse61 .cse2) 256) 127) (not (<= .cse60 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse60) 256) .cse4))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (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 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse62) 256) .cse4) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse62 127)) (<= (mod (+ .cse63 .cse2) 256) 127) (= 0 .cse62) (not (<= (mod .cse63 256) 127)) (= .cse63 0))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse64 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse65 (mod (+ .cse64 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse64 .cse2) 256) 127) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| (+ (- 256) .cse65)) 256) .cse4) (not (<= (mod .cse64 256) 127)) (<= .cse65 127) (= .cse64 0))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (or (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 ((.cse66 (mod .cse67 256))) (or (= .cse66 0) (<= (mod (+ .cse67 .cse2) 256) 127) (not (<= .cse66 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse67 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse66) 256) .cse4))))) (< |v_ULTIMATE.start_gcd_test_~a#1_29| 0)))))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) is different from true [2022-11-03 02:16:50,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 02:16:50,323 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:50,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306298589] [2022-11-03 02:16:50,323 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:16:50,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085306244] [2022-11-03 02:16:50,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085306244] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:16:50,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1548373762] [2022-11-03 02:16:50,326 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:16:50,326 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:16:50,326 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:16:50,326 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:16:50,327 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:16:50,701 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:16:59,021 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '304#(and (= |ULTIMATE.start_gcd_test_~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (<= |ULTIMATE.start_gcd_test_#in~a#1| 127) (<= |ULTIMATE.start_main1_~x~0#1| 127) (<= |ULTIMATE.start_gcd_test_#in~b#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (< 0 |ULTIMATE.start_main1_~y~0#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (ite (<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~y~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 (+ |ULTIMATE.start_main1_~x~0#1| 128)) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_#res#1|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:16:59,021 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:16:59,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:16:59,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-11-03 02:16:59,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536753668] [2022-11-03 02:16:59,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:16:59,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:16:59,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:59,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:16:59,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=161, Unknown=7, NotChecked=84, Total=306 [2022-11-03 02:16:59,024 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:07,420 WARN L234 SmtUtils]: Spent 5.96s on a formula simplification that was a NOOP. DAG size: 113 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:17:09,466 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse68 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse69 (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)))) (and (let ((.cse41 (< |c_ULTIMATE.start_main1_~y~0#1| 0)) (.cse40 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (and (let ((.cse4 (mod .cse40 256))) (let ((.cse26 (<= .cse4 127))) (or (and (let ((.cse2 (* .cse4 255))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (let ((.cse0 (mod .cse3 256))) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse0))) (and (not (<= (mod (+ (* 255 .cse0) .cse1) 256) 127)) (not (<= (mod (+ .cse2 .cse3) 256) 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (<= .cse0 127) (= .cse1 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse1 256))))))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse6 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4) 256))) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse6)))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= (mod .cse5 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= .cse5 0) (not (<= (mod (+ .cse5 .cse6) 256) 127)))))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (let ((.cse8 (mod (+ .cse2 .cse9) 256))) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse8)))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse7 256)) (not (<= (mod (+ .cse8 .cse7) 256) 127)) (= .cse7 0) (<= (mod .cse9 256) 127) (not (= .cse9 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse10 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4) 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse10)) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (<= .cse10 127))))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (let ((.cse11 (mod .cse13 256))) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse11))) (and (not (<= (mod (+ (* 255 .cse11) .cse12) 256) 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (<= (mod (+ .cse2 .cse13) 256) 127) (= .cse12 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse12 256))))))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (let ((.cse15 (mod .cse14 256))) (and (not (<= (mod (+ .cse2 .cse14) 256) 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse15 0)) (<= .cse15 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse15) 256)))))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) (mod (+ .cse2 .cse16) 256))) 256)) (not (<= (mod .cse16 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse17 (mod (+ .cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4)) 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse17) 256)) (not (= .cse17 0)) (<= .cse17 127) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (let ((.cse18 (mod (+ .cse2 .cse19) 256))) (and (not (<= .cse18 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse18)) 256)) (<= (mod .cse19 256) 127) (not (= .cse19 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) (mod (+ .cse2 .cse21) 256))))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse20 256)) (= .cse20 0) (not (<= (mod .cse21 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse23 (mod (+ .cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4)) 256))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse23))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse22 256)) (not (= .cse23 0)) (= .cse22 0) (<= .cse23 127) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (let ((.cse24 (mod .cse25 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse24 0)) (<= (mod (+ .cse2 .cse25) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse24) 256)))))) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) .cse26) (and (let ((.cse33 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse29 (+ .cse4 (- 256)))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse29))) (and (not (= .cse27 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) (mod (+ .cse27 .cse4) 256))))) (and (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= .cse28 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse28 256))))) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse30 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse29) 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse30) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (not (= .cse30 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse31 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse29) 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse31))) (and (= (mod (+ (* 255 .cse31) .cse32) 256) .cse33) (not (= .cse32 0)) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (not (= .cse31 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse29))) (and (not (= .cse34 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) (mod (+ .cse34 .cse4) 256))) 256)))) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse29) 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse36))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse35 256)) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= .cse35 0)))) (not (= .cse36 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse29))) (and (not (= .cse37 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse39 (mod (+ .cse37 .cse4) 256))) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse39)))) (and (= (mod (+ .cse38 .cse39) 256) .cse33) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (not (= .cse38 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0))))) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (not .cse26))))) .cse41) (and (not .cse41) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse42 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) (mod (+ .cse43 .cse40) 256))))) (and (= (mod .cse42 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (<= (mod .cse43 256) 127)) (= .cse42 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse46 (mod (+ .cse44 .cse40) 256))) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse46)))) (and (not (= .cse44 0)) (<= (mod .cse44 256) 127) (= (mod .cse45 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (<= .cse46 127)) (= .cse45 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse48 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse48)))) (and (= .cse47 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse47 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (<= (mod (+ .cse47 .cse48) 256) 127)))))) (<= |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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse49 (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) .cse40) 256))) (let ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse49))) (and (<= .cse49 127) (= .cse50 0) (not (<= (mod (+ (* 255 .cse49) .cse50) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse50 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) (mod (+ .cse51 .cse40) 256))) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (<= (mod .cse51 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse52 (mod .cse53 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse52) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse52 127) (not (<= (mod (+ .cse53 .cse40) 256) 127)) (not (= .cse52 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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse54 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse54)) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (<= .cse54 127))))) (<= |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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse55 (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) .cse40) 256))) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse55))) (let ((.cse57 (mod .cse56 256))) (and (<= .cse55 127) (not (<= (mod (+ (* 255 .cse55) .cse56) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse57) (<= .cse57 127) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse58 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse59 (mod (+ .cse58 .cse40) 256))) (and (not (= .cse58 0)) (<= (mod .cse58 256) 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse59)) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (<= .cse59 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse62 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse61 (mod .cse62 256))) (let ((.cse60 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse61))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= (mod .cse60 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse61 127) (not (<= (mod (+ .cse62 .cse40) 256) 127)) (= .cse60 0) (not (= .cse61 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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse63 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse64 (mod .cse63 256))) (and (<= (mod (+ .cse63 .cse40) 256) 127) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse64) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse64 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)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse65 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse67 (mod .cse65 256))) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse67))) (and (<= (mod (+ .cse65 .cse40) 256) 127) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= (mod .cse66 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= .cse66 0) (not (= .cse67 0))))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (< |c_ULTIMATE.start_gcd_test_~a#1| .cse68) .cse69) (or (< |c_ULTIMATE.start_gcd_test_~b#1| .cse68) (not (<= |c_ULTIMATE.start_gcd_test_~b#1| 127)) .cse69))) is different from false [2022-11-03 02:17:11,523 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse32 (< |c_ULTIMATE.start_main1_~y~0#1| 0)) (.cse31 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (and (let ((.cse4 (mod .cse31 256))) (let ((.cse17 (<= .cse4 127))) (or (and (let ((.cse0 (* .cse4 255))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (let ((.cse2 (mod .cse1 256))) (let ((.cse3 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse2) 256))) (and (not (<= (mod (+ .cse0 .cse1) 256) 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse2 0)) (not (= .cse3 0)) (<= .cse2 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse3) 256) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse3) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse6 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4) 256))) (let ((.cse5 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse6)) 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse5) 256) 0) (not (= .cse5 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse5) (not (<= .cse6 127)) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (let ((.cse7 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) (mod (+ .cse0 .cse8) 256))) 256))) (and (<= |c_ULTIMATE.start_main1_~g~0#1| .cse7) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse7) 256) 0) (not (= .cse7 0)) (not (<= (mod .cse8 256) 127)) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (let ((.cse10 (mod (+ .cse0 .cse11) 256))) (let ((.cse9 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse10)) 256))) (and (<= |c_ULTIMATE.start_main1_~g~0#1| .cse9) (not (<= .cse10 127)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse9) 256) 0) (<= (mod .cse11 256) 127) (not (= .cse9 0)) (not (= .cse11 0)) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse12 (mod (+ .cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4)) 256))) (let ((.cse13 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse12) 256))) (and (not (= .cse12 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse13) (not (= .cse13 0)) (<= .cse12 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse13) 256) 0) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (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| .cse4))) (let ((.cse14 (mod .cse16 256))) (let ((.cse15 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse14) 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse14 0)) (not (= .cse15 0)) (<= (mod (+ .cse0 .cse16) 256) 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse15) 256) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse15) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))))) .cse17) (and (not .cse17) (let ((.cse21 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse20 (+ .cse4 (- 256)))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse19 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse20) 256))) (let ((.cse18 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse19) 256))) (and (not (= .cse18 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse18) 256) 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse18) (not (= .cse19 0)))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse24 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse20) 256))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse24))) (let ((.cse22 (mod (+ (* 255 .cse24) .cse23) 256))) (and (<= .cse21 .cse22) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse23 0)) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ (- 256) .cse22)) 256) 0) (not (= .cse24 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse20))) (let ((.cse25 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) (mod (+ .cse26 .cse4) 256))) 256))) (and (not (= .cse25 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse25) 256) 0) (not (= .cse26 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse25) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse20))) (let ((.cse30 (mod (+ .cse27 .cse4) 256))) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse30)))) (let ((.cse28 (mod (+ .cse29 .cse30) 256))) (and (not (= .cse27 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| (+ .cse28 (- 256))) 256) 0) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= .cse21 .cse28) (not (= .cse29 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))))))))) .cse32) (and (not .cse32) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|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|) .cse31) 256))) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse34))) (let ((.cse33 (mod .cse35 256))) (and (not (= .cse33 0)) (<= .cse34 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse33) 256) 0) (not (<= (mod (+ (* 255 .cse34) .cse35) 256) 127)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse33) (<= .cse33 127) (<= |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_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse37 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse37)) 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse36) 256) 0) (not (= .cse36 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse36) (not (<= .cse37 127)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse40 (mod (+ .cse39 .cse31) 256))) (let ((.cse38 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) .cse40)) 256))) (and (<= |c_ULTIMATE.start_main1_~g~0#1| .cse38) (not (= .cse39 0)) (<= (mod .cse39 256) 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse38) 256) 0) (not (<= .cse40 127)) (not (= .cse38 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)))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse42 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse41 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| (+ (- 256) (mod (+ .cse42 .cse31) 256))) 256))) (and (<= |c_ULTIMATE.start_main1_~g~0#1| .cse41) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse41) 256) 0) (not (<= (mod .cse42 256) 127)) (not (= .cse41 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))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse44 (mod .cse45 256))) (let ((.cse43 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse44) 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse43) 256) 0) (<= .cse44 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse43) (not (= .cse43 0)) (not (<= (mod (+ .cse45 .cse31) 256) 127)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse44 0))))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse48 (mod .cse46 256))) (let ((.cse47 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse48) 256))) (and (<= (mod (+ .cse46 .cse31) 256) 127) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse47) 256) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse47) (not (= .cse47 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse48 0))))))) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_27|))))))) (or (<= |c_ULTIMATE.start_main1_~g~0#1| |c_ULTIMATE.start_main1_~y~0#1|) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127)) is different from false [2022-11-03 02:17:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:12,021 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-11-03 02:17:12,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:17:12,021 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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 9 [2022-11-03 02:17:12,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:12,022 INFO L225 Difference]: With dead ends: 32 [2022-11-03 02:17:12,023 INFO L226 Difference]: Without dead ends: 26 [2022-11-03 02:17:12,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 326.4s TimeCoverageRelationStatistics Valid=75, Invalid=242, Unknown=9, NotChecked=180, Total=506 [2022-11-03 02:17:12,025 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 1 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:12,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 111 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 42 Unchecked, 0.2s Time] [2022-11-03 02:17:12,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-03 02:17:12,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-03 02:17:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 02:17:12,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-11-03 02:17:12,042 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 9 [2022-11-03 02:17:12,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:12,042 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-11-03 02:17:12,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-11-03 02:17:12,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:17:12,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:12,044 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:12,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:17:12,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:17:12,267 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:12,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:12,267 INFO L85 PathProgramCache]: Analyzing trace with hash -792975892, now seen corresponding path program 3 times [2022-11-03 02:17:12,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:12,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226606221] [2022-11-03 02:17:12,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:12,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:12,276 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:17:12,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [162191463] [2022-11-03 02:17:12,276 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:17:12,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:17:12,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:17:12,278 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:17:12,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:17:12,574 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:17:12,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:17:12,576 WARN L261 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-03 02:17:12,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:17:16,865 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (let ((.cse19 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse3 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse0 (< |c_ULTIMATE.start_main1_~y~0#1| 0))) (or (and .cse0 (let ((.cse1 (mod .cse19 256))) (let ((.cse6 (<= .cse1 127))) (or (and (<= .cse1 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (let ((.cse4 (+ .cse1 (- 256)))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse4))) (and (not (= .cse2 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (= (mod (+ .cse2 .cse1) 256) .cse3)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse4) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse4))) (and (= .cse5 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse5 256))))))) (not .cse6)) (and (let ((.cse8 (* .cse1 255))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse1))) (and (= .cse7 0) (not (<= (mod (+ .cse8 .cse7) 256) 127)) (= (mod .cse7 256) |c_ULTIMATE.start_gcd_test_~b#1|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse1))) (let ((.cse10 (mod (+ .cse8 .cse9) 256))) (and (not (= .cse9 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (= .cse10 .cse3) (not (<= .cse10 127)) (<= (mod .cse9 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse1))) (and (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (= (mod (+ .cse8 .cse11) 256) .cse3) (not (<= (mod .cse11 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse1))) (let ((.cse13 (mod (+ .cse8 .cse12) 256))) (and (not (= .cse12 0)) (<= .cse13 127) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (= .cse13 |c_ULTIMATE.start_gcd_test_~b#1|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse1))) (let ((.cse15 (mod .cse14 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (not (<= (mod (+ .cse8 .cse14) 256) 127)) (= .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse15 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse1))) (and (<= (mod (+ .cse8 .cse16) 256) 127) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (= (mod .cse16 256) |c_ULTIMATE.start_gcd_test_~b#1|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse1))) (and (<= (mod (+ .cse8 .cse17) 256) 127) (= .cse17 0) (= (mod .cse17 256) |c_ULTIMATE.start_gcd_test_~b#1|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse18 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse1) 256))) (and (= .cse18 .cse3) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (not (<= .cse18 127))))))) .cse6 (<= .cse1 |c_ULTIMATE.start_gcd_test_~a#1|)))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse20 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (= .cse20 .cse3) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (not (<= .cse20 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse21 (mod (+ .cse19 .cse22) 256))) (and (<= .cse21 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse21) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (not (= .cse22 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse23 (mod .cse24 256))) (and (<= .cse23 127) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (not (<= (mod (+ .cse19 .cse24) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse23))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= .cse25 0) (not (<= (mod (+ .cse19 .cse25) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse25 256))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= (mod (+ .cse19 .cse26) 256) 127) (= .cse26 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse26 256))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= (mod (+ .cse19 .cse27) 256) 127) (not (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse27 256))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse29 (mod (+ .cse19 .cse28) 256))) (and (<= (mod .cse28 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (not (<= .cse29 127)) (not (= .cse28 0)) (= .cse29 .cse3))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_main1_~y~0#1|))) (and (< |v_ULTIMATE.start_gcd_test_~a#1_33| 0) (= (mod (+ .cse19 .cse30) 256) .cse3) (not (<= (mod .cse30 256) 127)))))) (not .cse0) (<= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~a#1|))))) is different from false [2022-11-03 02:23:23,774 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-11-03 02:23:23,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-11-03 02:23:23,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:23:23,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226606221] [2022-11-03 02:23:23,776 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:23:23,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162191463] [2022-11-03 02:23:23,776 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2022-11-03 02:23:23,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1098017660] [2022-11-03 02:23:23,778 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-03 02:23:23,779 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:23:23,779 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:23:23,779 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:23:23,779 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:23:23,784 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:158) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:274) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:221) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) 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: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:156) ... 44 more [2022-11-03 02:23:23,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:23:23,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2022-11-03 02:23:23,786 ERROR L170 FreeRefinementEngine]: Strategy SIFA_TAIPAN failed to provide any proof altough trace is infeasible [2022-11-03 02:23:23,787 INFO L359 BasicCegarLoop]: Counterexample might be feasible [2022-11-03 02:23:23,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-03 02:23:23,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-03 02:23:23,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:23:23,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:23:23,997 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1] [2022-11-03 02:23:24,001 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:23:24,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:23:24 BoogieIcfgContainer [2022-11-03 02:23:24,013 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:23:24,014 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:23:24,014 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:23:24,015 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:23:24,015 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:10:33" (3/4) ... [2022-11-03 02:23:24,020 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-03 02:23:24,021 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:23:24,023 INFO L158 Benchmark]: Toolchain (without parser) took 772276.77ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 79.3MB in the beginning and 38.8MB in the end (delta: 40.5MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2022-11-03 02:23:24,023 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 115.3MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:23:24,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.38ms. Allocated memory is still 115.3MB. Free memory was 79.1MB in the beginning and 90.6MB in the end (delta: -11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 02:23:24,028 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.49ms. Allocated memory is still 115.3MB. Free memory was 90.6MB in the beginning and 89.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:23:24,028 INFO L158 Benchmark]: Boogie Preprocessor took 34.22ms. Allocated memory is still 115.3MB. Free memory was 89.0MB in the beginning and 87.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:23:24,029 INFO L158 Benchmark]: RCFGBuilder took 700.87ms. Allocated memory is still 115.3MB. Free memory was 87.6MB in the beginning and 72.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-03 02:23:24,032 INFO L158 Benchmark]: TraceAbstraction took 770964.22ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 72.2MB in the beginning and 38.8MB in the end (delta: 33.4MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. [2022-11-03 02:23:24,032 INFO L158 Benchmark]: Witness Printer took 6.67ms. Allocated memory is still 138.4MB. Free memory is still 38.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:23:24,035 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.40ms. Allocated memory is still 115.3MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 509.38ms. Allocated memory is still 115.3MB. Free memory was 79.1MB in the beginning and 90.6MB in the end (delta: -11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.49ms. Allocated memory is still 115.3MB. Free memory was 90.6MB in the beginning and 89.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.22ms. Allocated memory is still 115.3MB. Free memory was 89.0MB in the beginning and 87.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 700.87ms. Allocated memory is still 115.3MB. Free memory was 87.6MB in the beginning and 72.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 770964.22ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 72.2MB in the beginning and 38.8MB in the end (delta: 33.4MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. * Witness Printer took 6.67ms. Allocated memory is still 138.4MB. Free memory is still 38.8MB. There was no memory consumed. 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 - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L108] COND TRUE __VERIFIER_nondet_int() [L109] CALL main1() [L49] signed char x = __VERIFIER_nondet_char(); [L50] signed char y = __VERIFIER_nondet_char(); [L51] signed char g; [L53] CALL, EXPR gcd_test(x, y) [L33] signed char t; [L35] COND TRUE a < (signed char)0 [L35] a = -a [L36] COND FALSE !(b < (signed char)0) [L38] COND TRUE b != (signed char)0 [L39] t = b [L40] b = a % b [L41] a = t [L38] COND TRUE b != (signed char)0 [L39] t = b [L40] b = a % b [L41] a = t [L38] COND TRUE b != (signed char)0 [L39] t = b [L40] b = a % b [L41] a = t [L38] COND TRUE b != (signed char)0 [L39] t = b [L40] b = a % b [L41] a = t [L38] COND TRUE b != (signed char)0 [L39] t = b [L40] b = a % b [L41] a = t [L38] COND TRUE b != (signed char)0 [L39] t = b [L40] b = a % b [L41] a = t [L38] COND FALSE !(b != (signed char)0) [L43] return a; [L53] RET, EXPR gcd_test(x, y) [L53] g = gcd_test(x, y) [L55] COND TRUE y > (signed char)0 [L56] CALL __VERIFIER_assert(y >= g) [L26] COND TRUE !(cond) [L27] reach_error() - UnprovableResult [Line: 102]: 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, 25 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 770.8s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 241 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 42 IncrementalHoareTripleChecker+Unchecked, 256 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 122 IncrementalHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 46 mSDtfsCounter, 122 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 327.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=3, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 745.9s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 33 ConstructedInterpolants, 5 QuantifiedInterpolants, 7883 SizeOfPredicates, 18 NumberOfNonLiveVariables, 232 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/14 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 could not prove your program: unable to determine feasibility of some traces 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_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI --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 edf451b08ccf28b9358a6fa7c10128ea1b9a8f09b01361f9cd588dc4a31f271a --- 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-5e519f3 [2022-11-03 02:23:26,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:23:26,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:23:26,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:23:26,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:23:26,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:23:26,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:23:26,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:23:26,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:23:26,434 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:23:26,436 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:23:26,437 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:23:26,438 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:23:26,441 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:23:26,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:23:26,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:23:26,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:23:26,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:23:26,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:23:26,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:23:26,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:23:26,463 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:23:26,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:23:26,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:23:26,475 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:23:26,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:23:26,480 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:23:26,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:23:26,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:23:26,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:23:26,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:23:26,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:23:26,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:23:26,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:23:26,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:23:26,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:23:26,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:23:26,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:23:26,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:23:26,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:23:26,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:23:26,496 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-03 02:23:26,539 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:23:26,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:23:26,541 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:23:26,541 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:23:26,543 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:23:26,543 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:23:26,544 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:23:26,544 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:23:26,545 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:23:26,545 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:23:26,546 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:23:26,547 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:23:26,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:23:26,549 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:23:26,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:23:26,550 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:23:26,550 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:23:26,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:23:26,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:23:26,551 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 02:23:26,551 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 02:23:26,552 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 02:23:26,552 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:23:26,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:23:26,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:23:26,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:23:26,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:23:26,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 02:23:26,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:23:26,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:23:26,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:23:26,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:23:26,556 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:23:26,557 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 02:23:26,557 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 02:23:26,557 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:23:26,558 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:23:26,558 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 02:23:26,558 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_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/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_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI 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 -> edf451b08ccf28b9358a6fa7c10128ea1b9a8f09b01361f9cd588dc4a31f271a [2022-11-03 02:23:26,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:23:27,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:23:27,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:23:27,035 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:23:27,036 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:23:27,039 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/combinations/gcd_2+newton_2_2.i [2022-11-03 02:23:27,114 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/data/f54719c46/6fedaf6688584dc6ab32b05205d16fc8/FLAGb91ae1ae7 [2022-11-03 02:23:27,651 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:23:27,652 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i [2022-11-03 02:23:27,662 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/data/f54719c46/6fedaf6688584dc6ab32b05205d16fc8/FLAGb91ae1ae7 [2022-11-03 02:23:28,028 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/data/f54719c46/6fedaf6688584dc6ab32b05205d16fc8 [2022-11-03 02:23:28,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:23:28,035 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:23:28,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:23:28,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:23:28,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:23:28,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:23:28" (1/1) ... [2022-11-03 02:23:28,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44b6361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:28, skipping insertion in model container [2022-11-03 02:23:28,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:23:28" (1/1) ... [2022-11-03 02:23:28,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:23:28,099 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:23:28,322 WARN L230 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_7d34f1fe-107c-4eea-8cec-54c61f7036f4/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[1226,1239] [2022-11-03 02:23:28,378 WARN L230 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_7d34f1fe-107c-4eea-8cec-54c61f7036f4/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[2841,2854] [2022-11-03 02:23:28,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:23:28,449 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:23:28,477 WARN L230 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_7d34f1fe-107c-4eea-8cec-54c61f7036f4/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[1226,1239] [2022-11-03 02:23:28,494 WARN L230 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_7d34f1fe-107c-4eea-8cec-54c61f7036f4/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[2841,2854] [2022-11-03 02:23:28,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:23:28,522 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:23:28,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:28 WrapperNode [2022-11-03 02:23:28,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:23:28,524 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:23:28,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:23:28,524 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:23:28,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:28" (1/1) ... [2022-11-03 02:23:28,561 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:28" (1/1) ... [2022-11-03 02:23:28,581 INFO L138 Inliner]: procedures = 28, calls = 16, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 72 [2022-11-03 02:23:28,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:23:28,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:23:28,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:23:28,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:23:28,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:28" (1/1) ... [2022-11-03 02:23:28,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:28" (1/1) ... [2022-11-03 02:23:28,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:28" (1/1) ... [2022-11-03 02:23:28,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:28" (1/1) ... [2022-11-03 02:23:28,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:28" (1/1) ... [2022-11-03 02:23:28,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:28" (1/1) ... [2022-11-03 02:23:28,648 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:28" (1/1) ... [2022-11-03 02:23:28,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:28" (1/1) ... [2022-11-03 02:23:28,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:23:28,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:23:28,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:23:28,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:23:28,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:28" (1/1) ... [2022-11-03 02:23:28,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:23:28,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:23:28,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:23:28,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:23:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:23:28,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 02:23:28,750 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-03 02:23:28,750 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-03 02:23:28,750 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-03 02:23:28,751 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-03 02:23:28,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:23:28,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:23:28,829 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:23:28,831 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:23:37,995 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:23:38,002 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:23:38,003 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 02:23:38,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:23:38 BoogieIcfgContainer [2022-11-03 02:23:38,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:23:38,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:23:38,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:23:38,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:23:38,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:23:28" (1/3) ... [2022-11-03 02:23:38,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afc6c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:23:38, skipping insertion in model container [2022-11-03 02:23:38,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:28" (2/3) ... [2022-11-03 02:23:38,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afc6c32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:23:38, skipping insertion in model container [2022-11-03 02:23:38,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:23:38" (3/3) ... [2022-11-03 02:23:38,016 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_2.i [2022-11-03 02:23:38,039 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:23:38,039 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-03 02:23:38,141 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:23:38,154 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;@2065cbc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:23:38,155 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-03 02:23:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 02:23:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:23:38,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:23:38,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:23:38,170 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:23:38,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:23:38,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-11-03 02:23:38,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:23:38,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419082558] [2022-11-03 02:23:38,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:23:38,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:23:38,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:23:38,202 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:23:38,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 02:23:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:23:38,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:23:38,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:23:38,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:23:38,534 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:23:38,535 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:23:38,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419082558] [2022-11-03 02:23:38,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419082558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:23:38,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:23:38,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:23:38,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000100109] [2022-11-03 02:23:38,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:23:38,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:23:38,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:23:38,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:23:38,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:23:38,596 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:23:38,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:23:38,642 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2022-11-03 02:23:38,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:23:38,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 02:23:38,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:23:38,653 INFO L225 Difference]: With dead ends: 68 [2022-11-03 02:23:38,654 INFO L226 Difference]: Without dead ends: 30 [2022-11-03 02:23:38,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:23:38,666 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:23:38,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-11-03 02:23:38,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-03 02:23:38,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-03 02:23:38,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 02:23:38,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-03 02:23:38,723 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2022-11-03 02:23:38,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:23:38,724 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-03 02:23:38,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:23:38,724 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-03 02:23:38,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:23:38,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:23:38,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:23:38,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:23:38,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:23:38,943 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:23:38,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:23:38,944 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2022-11-03 02:23:38,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:23:38,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956295791] [2022-11-03 02:23:38,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:23:38,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:23:38,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:23:38,954 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:23:38,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 02:23:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:23:39,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:23:39,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:23:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:23:39,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:23:39,193 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:23:39,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956295791] [2022-11-03 02:23:39,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956295791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:23:39,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:23:39,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:23:39,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915794668] [2022-11-03 02:23:39,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:23:39,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:23:39,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:23:39,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:23:39,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:23:39,197 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:23:39,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:23:39,420 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-11-03 02:23:39,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:23:39,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 02:23:39,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:23:39,428 INFO L225 Difference]: With dead ends: 37 [2022-11-03 02:23:39,428 INFO L226 Difference]: Without dead ends: 31 [2022-11-03 02:23:39,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:23:39,430 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.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:23:39,431 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.2s Time] [2022-11-03 02:23:39,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-03 02:23:39,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-11-03 02:23:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 02:23:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-03 02:23:39,439 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2022-11-03 02:23:39,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:23:39,440 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-03 02:23:39,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:23:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-03 02:23:39,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:23:39,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:23:39,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:23:39,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:23:39,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:23:39,662 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:23:39,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:23:39,662 INFO L85 PathProgramCache]: Analyzing trace with hash 149955676, now seen corresponding path program 1 times [2022-11-03 02:23:39,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:23:39,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270974807] [2022-11-03 02:23:39,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:23:39,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:23:39,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:23:39,667 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:23:39,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 02:23:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:23:39,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:23:39,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:23:39,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:23:39,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:23:39,961 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:23:39,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270974807] [2022-11-03 02:23:39,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270974807] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:23:39,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:23:39,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:23:39,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129786542] [2022-11-03 02:23:39,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:23:39,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:23:39,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:23:39,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:23:39,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:23:39,969 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:23:40,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:23:40,094 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-11-03 02:23:40,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:23:40,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 02:23:40,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:23:40,098 INFO L225 Difference]: With dead ends: 38 [2022-11-03 02:23:40,098 INFO L226 Difference]: Without dead ends: 30 [2022-11-03 02:23:40,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:23:40,102 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:23:40,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 84 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:23:40,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-03 02:23:40,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-03 02:23:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 02:23:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-03 02:23:40,119 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 12 [2022-11-03 02:23:40,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:23:40,120 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-03 02:23:40,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:23:40,121 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-03 02:23:40,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:23:40,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:23:40,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:23:40,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-11-03 02:23:40,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:23:40,343 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:23:40,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:23:40,343 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2022-11-03 02:23:40,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:23:40,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334616572] [2022-11-03 02:23:40,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:23:40,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:23:40,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:23:40,347 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:23:40,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 02:23:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:23:40,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 02:23:40,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:23:41,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:23:41,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:23:41,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:23:41,969 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:23:41,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334616572] [2022-11-03 02:23:41,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334616572] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:23:41,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2123581323] [2022-11-03 02:23:41,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:23:41,975 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:23:41,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:23:41,985 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:23:41,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-11-03 02:23:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:23:42,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 02:23:42,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:23:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:23:42,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:23:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:23:42,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2123581323] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:23:42,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115487919] [2022-11-03 02:23:42,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:23:42,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:23:42,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:23:42,690 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:23:42,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:23:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:23:42,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 02:23:42,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:23:43,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:23:43,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:23:43,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:23:43,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115487919] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:23:43,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:23:43,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 7] total 18 [2022-11-03 02:23:43,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173470945] [2022-11-03 02:23:43,983 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:23:43,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 02:23:43,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:23:43,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 02:23:43,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:23:43,986 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:23:48,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:23:48,193 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-11-03 02:23:48,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 02:23:48,195 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 02:23:48,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:23:48,196 INFO L225 Difference]: With dead ends: 43 [2022-11-03 02:23:48,196 INFO L226 Difference]: Without dead ends: 20 [2022-11-03 02:23:48,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=248, Invalid=744, Unknown=0, NotChecked=0, Total=992 [2022-11-03 02:23:48,198 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 65 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:23:48,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 159 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-03 02:23:48,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-03 02:23:48,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-03 02:23:48,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 02:23:48,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-11-03 02:23:48,204 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2022-11-03 02:23:48,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:23:48,204 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-11-03 02:23:48,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:23:48,205 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-11-03 02:23:48,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 02:23:48,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:23:48,206 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:23:48,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:23:48,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:23:48,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:23:48,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:23:48,821 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:23:48,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:23:48,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1535073882, now seen corresponding path program 1 times [2022-11-03 02:23:48,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:23:48,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218622752] [2022-11-03 02:23:48,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:23:48,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:23:48,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:23:48,824 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:23:48,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d34f1fe-107c-4eea-8cec-54c61f7036f4/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process