./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/gcd_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/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_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/gcd_1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/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_ea0d5891-542d-42ee-b05e-9e3635ca8216/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 739715c3f9b6cd78741b6d155210624f17d4bf167a3be4c6127f06707080edde --- 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:35:37,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:35:37,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:35:37,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:35:37,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:35:37,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:35:37,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:35:37,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:35:37,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:35:37,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:35:37,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:35:37,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:35:37,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:35:37,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:35:37,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:35:37,387 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:35:37,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:35:37,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:35:37,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:35:37,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:35:37,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:35:37,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:35:37,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:35:37,406 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:35:37,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:35:37,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:35:37,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:35:37,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:35:37,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:35:37,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:35:37,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:35:37,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:35:37,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:35:37,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:35:37,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:35:37,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:35:37,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:35:37,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:35:37,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:35:37,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:35:37,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:35:37,430 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:35:37,480 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:35:37,482 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:35:37,483 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:35:37,483 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:35:37,484 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:35:37,485 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:35:37,485 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:35:37,485 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:35:37,485 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:35:37,486 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:35:37,487 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:35:37,487 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:35:37,488 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:35:37,488 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:35:37,488 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:35:37,488 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:35:37,489 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:35:37,489 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:35:37,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:35:37,490 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:35:37,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:35:37,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:35:37,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:35:37,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:35:37,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:35:37,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:35:37,492 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:35:37,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:35:37,492 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:35:37,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:35:37,493 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:35:37,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:35:37,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:35:37,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:35:37,494 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:35:37,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:35:37,495 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:35:37,495 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:35:37,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:35:37,495 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:35:37,496 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:35:37,496 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_ea0d5891-542d-42ee-b05e-9e3635ca8216/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_ea0d5891-542d-42ee-b05e-9e3635ca8216/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 -> 739715c3f9b6cd78741b6d155210624f17d4bf167a3be4c6127f06707080edde [2022-11-03 02:35:37,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:35:37,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:35:37,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:35:37,865 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:35:37,866 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:35:37,868 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/bitvector/gcd_1.c [2022-11-03 02:35:37,952 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/data/17f562fc7/a51ae01b0bab414997faacfdae6afc03/FLAG99853a313 [2022-11-03 02:35:38,426 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:35:38,426 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/sv-benchmarks/c/bitvector/gcd_1.c [2022-11-03 02:35:38,435 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/data/17f562fc7/a51ae01b0bab414997faacfdae6afc03/FLAG99853a313 [2022-11-03 02:35:38,775 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/data/17f562fc7/a51ae01b0bab414997faacfdae6afc03 [2022-11-03 02:35:38,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:35:38,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:35:38,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:35:38,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:35:38,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:35:38,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:35:38" (1/1) ... [2022-11-03 02:35:38,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16677083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:38, skipping insertion in model container [2022-11-03 02:35:38,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:35:38" (1/1) ... [2022-11-03 02:35:38,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:35:38,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:35:39,028 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_ea0d5891-542d-42ee-b05e-9e3635ca8216/sv-benchmarks/c/bitvector/gcd_1.c[664,677] [2022-11-03 02:35:39,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:35:39,055 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:35:39,068 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_ea0d5891-542d-42ee-b05e-9e3635ca8216/sv-benchmarks/c/bitvector/gcd_1.c[664,677] [2022-11-03 02:35:39,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:35:39,095 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:35:39,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:39 WrapperNode [2022-11-03 02:35:39,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:35:39,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:35:39,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:35:39,096 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:35:39,104 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:35:39" (1/1) ... [2022-11-03 02:35:39,112 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:35:39" (1/1) ... [2022-11-03 02:35:39,133 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2022-11-03 02:35:39,134 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:35:39,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:35:39,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:35:39,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:35:39,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:39" (1/1) ... [2022-11-03 02:35:39,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:39" (1/1) ... [2022-11-03 02:35:39,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:39" (1/1) ... [2022-11-03 02:35:39,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:39" (1/1) ... [2022-11-03 02:35:39,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:39" (1/1) ... [2022-11-03 02:35:39,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:39" (1/1) ... [2022-11-03 02:35:39,155 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:39" (1/1) ... [2022-11-03 02:35:39,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:39" (1/1) ... [2022-11-03 02:35:39,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:35:39,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:35:39,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:35:39,159 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:35:39,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:39" (1/1) ... [2022-11-03 02:35:39,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:35:39,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:35:39,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:35:39,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:35:39,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:35:39,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:35:39,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:35:39,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:35:39,310 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:35:39,313 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:35:39,531 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:35:39,591 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:35:39,592 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-03 02:35:39,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:35:39 BoogieIcfgContainer [2022-11-03 02:35:39,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:35:39,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:35:39,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:35:39,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:35:39,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:35:38" (1/3) ... [2022-11-03 02:35:39,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785e8384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:35:39, skipping insertion in model container [2022-11-03 02:35:39,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:35:39" (2/3) ... [2022-11-03 02:35:39,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785e8384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:35:39, skipping insertion in model container [2022-11-03 02:35:39,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:35:39" (3/3) ... [2022-11-03 02:35:39,617 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_1.c [2022-11-03 02:35:39,650 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:35:39,650 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 02:35:39,702 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:35:39,710 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;@33acd746, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:35:39,720 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 02:35:39,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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:35:39,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 02:35:39,733 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:39,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 02:35:39,734 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:35:39,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:39,744 INFO L85 PathProgramCache]: Analyzing trace with hash 77541297, now seen corresponding path program 1 times [2022-11-03 02:35:39,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:35:39,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009162029] [2022-11-03 02:35:39,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:39,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:35:39,909 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:35:39,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [540724966] [2022-11-03 02:35:39,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:39,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:35:39,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:35:39,914 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:35:39,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:35:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:40,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:35:40,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:40,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:35:40,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:35:40,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:35:40,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009162029] [2022-11-03 02:35:40,179 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:35:40,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540724966] [2022-11-03 02:35:40,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540724966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:35:40,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:35:40,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:35:40,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388184758] [2022-11-03 02:35:40,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:35:40,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:35:40,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:35:40,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:35:40,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:35:40,246 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:35:40,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:40,298 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-11-03 02:35:40,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:35:40,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-11-03 02:35:40,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:40,324 INFO L225 Difference]: With dead ends: 16 [2022-11-03 02:35:40,327 INFO L226 Difference]: Without dead ends: 7 [2022-11-03 02:35:40,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:35:40,386 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:40,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:35:40,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2022-11-03 02:35:40,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-11-03 02:35:40,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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:35:40,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2022-11-03 02:35:40,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2022-11-03 02:35:40,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:40,448 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2022-11-03 02:35:40,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:35:40,449 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-11-03 02:35:40,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 02:35:40,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:40,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 02:35:40,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:40,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:35:40,667 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:35:40,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:40,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1892089494, now seen corresponding path program 1 times [2022-11-03 02:35:40,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:35:40,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539774858] [2022-11-03 02:35:40,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:40,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:35:40,688 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:35:40,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [47516944] [2022-11-03 02:35:40,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:40,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:35:40,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:35:40,692 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:35:40,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:35:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:40,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 02:35:40,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:40,864 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:35:40,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:40,920 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:35:40,921 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:35:40,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539774858] [2022-11-03 02:35:40,921 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:35:40,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47516944] [2022-11-03 02:35:40,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47516944] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:40,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [552921272] [2022-11-03 02:35:40,940 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2022-11-03 02:35:40,941 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:35:40,944 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:35:40,950 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:35:40,950 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:35:41,430 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:35:41,708 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '95#(and (= |ULTIMATE.start_gcd_test_~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#res#1| 128)) (<= |ULTIMATE.start_gcd_test_#in~a#1| 127) (<= |ULTIMATE.start_main_~x~0#1| 127) (<= |ULTIMATE.start_gcd_test_#in~b#1| 127) (<= 0 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 127) (= |ULTIMATE.start_main_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_gcd_test_#in~b#1|) (<= 0 (+ |ULTIMATE.start_main_~x~0#1| 128)) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#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___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_~g~0#1| |ULTIMATE.start_main_~y~0#1|) 1 0)) (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_#res#1|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:35:41,709 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:35:41,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:35:41,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-11-03 02:35:41,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240270407] [2022-11-03 02:35:41,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:35:41,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:35:41,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:35:41,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:35:41,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:35:41,712 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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:35:41,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:41,762 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-11-03 02:35:41,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:35:41,762 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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:35:41,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:41,763 INFO L225 Difference]: With dead ends: 11 [2022-11-03 02:35:41,763 INFO L226 Difference]: Without dead ends: 8 [2022-11-03 02:35:41,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:35:41,765 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:41,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 11 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:35:41,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-11-03 02:35:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-11-03 02:35:41,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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:35:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-11-03 02:35:41,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-11-03 02:35:41,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:41,769 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-11-03 02:35:41,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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:35:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-11-03 02:35:41,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 02:35:41,770 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:41,771 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-11-03 02:35:41,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:41,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:35:41,986 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:35:41,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:41,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1473865425, now seen corresponding path program 2 times [2022-11-03 02:35:41,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:35:41,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305986650] [2022-11-03 02:35:41,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:41,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:35:41,997 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:35:41,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1694840694] [2022-11-03 02:35:41,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:35:41,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:35:41,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:35:42,003 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:35:42,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:35:59,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:35:59,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:35:59,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 02:35:59,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:36:20,310 WARN L234 SmtUtils]: Spent 9.02s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:36:31,391 WARN L234 SmtUtils]: Spent 5.88s on a formula simplification. DAG size of input: 43 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:37:07,395 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) 0) (= (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |v_ULTIMATE.start_gcd_test_~a#1_26|) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-03 02:37:27,744 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse0 (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |v_ULTIMATE.start_gcd_test_~a#1_26|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) 0) (not (= .cse0 0)) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse0) 256) 0) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) is different from false [2022-11-03 02:37:29,749 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse0 (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |v_ULTIMATE.start_gcd_test_~a#1_26|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) 0) (not (= .cse0 0)) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse0) 256) 0) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) is different from true [2022-11-03 02:37:48,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 02:37:48,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:40:27,566 WARN L234 SmtUtils]: Spent 2.08m on a formula simplification. DAG size of input: 116 DAG size of output: 114 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:40:53,945 WARN L855 $PredicateComparison]: unable to prove that (or (not (< |c_ULTIMATE.start_main_~x~0#1| 0)) (not (< 0 |c_ULTIMATE.start_main_~y~0#1|)) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|) 0)) (let ((.cse2 (mod (* |c_ULTIMATE.start_main_~x~0#1| 255) 256))) (let ((.cse1 (<= .cse2 127))) (and (let ((.cse0 (mod (+ (- 256) .cse2) |c_ULTIMATE.start_main_~y~0#1|))) (or (= .cse0 0) (not (= (mod (mod |c_ULTIMATE.start_main_~y~0#1| (+ (- 256) (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| 255) .cse0) 256))) 256) 0)) .cse1)) (let ((.cse3 (mod (mod .cse2 |c_ULTIMATE.start_main_~y~0#1|) 256))) (or (not (= (mod (mod |c_ULTIMATE.start_main_~y~0#1| .cse3) 256) 0)) (not .cse1) (= .cse3 0))))))) is different from true [2022-11-03 02:40:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:40:53,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:40:53,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305986650] [2022-11-03 02:40:53,947 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-03 02:40:53,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694840694] [2022-11-03 02:40:53,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694840694] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:40:53,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [434370566] [2022-11-03 02:40:53,950 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2022-11-03 02:40:53,951 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:40:53,951 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:40:53,952 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:40:53,952 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:40:58,050 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:41:07,347 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '173#(and (= |ULTIMATE.start_gcd_test_~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#res#1| 128)) (= |ULTIMATE.start_main_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_~g~0#1| |ULTIMATE.start_main_~y~0#1|) 1 0)) (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_#res#1|))' at error location [2022-11-03 02:41:07,347 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:41:07,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:41:07,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2022-11-03 02:41:07,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895510266] [2022-11-03 02:41:07,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:41:07,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:41:07,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:41:07,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:41:07,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=82, Unknown=10, NotChecked=60, Total=182 [2022-11-03 02:41:07,351 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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:41:08,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-03 02:42:09,385 WARN L234 SmtUtils]: Spent 53.70s on a formula simplification. DAG size of input: 46 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:42:11,554 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse31 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse21 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse30 (mod (+ .cse31 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse29 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse22 (mod .cse31 256)) (.cse13 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse29) 256) 0))) (.cse10 (= .cse29 0)) (.cse3 (<= .cse29 127)) (.cse14 (<= .cse30 127)) (.cse17 (= .cse30 0)) (.cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 0))) (.cse9 (not .cse21))) (let ((.cse0 (= .cse31 0)) (.cse16 (or .cse17 .cse18 .cse9)) (.cse19 (not .cse14)) (.cse11 (not .cse3)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse30)) 256) 0))) (.cse15 (or .cse8 .cse9 .cse10)) (.cse6 (not .cse13)) (.cse20 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse29)) 256) 0))) (.cse23 (<= .cse22 127))) (and (<= |c_ULTIMATE.start_main_~x~0#1| 127) (or (and .cse0 (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int)) (let ((.cse1 (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (not (<= .cse1 127)) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse1)))) (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int)) (let ((.cse2 (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (<= .cse2 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse2))))) (or (let ((.cse7 (or .cse21 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse22) 256) 0)) (= .cse22 0)))) (let ((.cse5 (or .cse6 (and .cse7 (or .cse0 .cse20 .cse9))))) (and (or (let ((.cse4 (or (and (or .cse0 .cse12 .cse9) .cse7) .cse13))) (and (or .cse3 (and .cse4 .cse5)) (or (and (or .cse6 (and .cse7 (or .cse8 .cse0 .cse9 .cse10))) .cse4) .cse11))) .cse14) (or (and (or (and (or .cse6 (and .cse7 .cse15)) (or (and .cse7 .cse16) .cse13)) .cse11) (or (and (or .cse13 (and .cse7 (or .cse0 .cse17 .cse18 .cse9))) .cse5) .cse3)) .cse19)))) (not .cse23)) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (or (let ((.cse27 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse22)) 256) 0)) .cse21))) (let ((.cse25 (or .cse6 (and (or .cse20 .cse9) .cse27))) (.cse26 (or .cse6 (and .cse27 .cse15)))) (and (or (let ((.cse24 (or (and .cse27 .cse16) .cse13))) (and (or (and .cse24 .cse25) .cse3) (or .cse11 (and .cse26 .cse24)))) .cse19) (or (let ((.cse28 (or .cse13 (and (or .cse12 .cse9) .cse27)))) (and (or (and .cse25 .cse28) .cse3) (or (and .cse26 .cse28) .cse11))) .cse14)))) .cse23) (<= 0 (+ |c_ULTIMATE.start_main_~x~0#1| 128)) (<= |c_ULTIMATE.start_main_~y~0#1| 127) (< 0 |c_ULTIMATE.start_gcd_test_~b#1|)))))) is different from false [2022-11-03 02:42:13,662 WARN L833 $PredicateComparison]: unable to prove that (and (or (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 128))) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 256) 0)) (not (<= |c_ULTIMATE.start_gcd_test_~b#1| 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (or (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int)) (let ((.cse0 (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256))) (and (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse0 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (<= .cse0 127)))) (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int)) (let ((.cse2 (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256))) (let ((.cse1 (mod (+ (- 256) .cse2) |c_ULTIMATE.start_gcd_test_~a#1|))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= .cse1 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (not (<= .cse2 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse1 256))))))) (< 0 |c_ULTIMATE.start_gcd_test_~a#1|)) is different from false [2022-11-03 02:42:15,673 WARN L833 $PredicateComparison]: unable to prove that (and (or (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)))) (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) 0) (= (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |v_ULTIMATE.start_gcd_test_~a#1_26|) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-03 02:42:17,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-03 02:42:17,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:42:17,688 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-11-03 02:42:17,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:42:17,852 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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:42:17,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:42:17,852 INFO L225 Difference]: With dead ends: 12 [2022-11-03 02:42:17,853 INFO L226 Difference]: Without dead ends: 9 [2022-11-03 02:42:17,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 235.6s TimeCoverageRelationStatistics Valid=39, Invalid=102, Unknown=15, NotChecked=150, Total=306 [2022-11-03 02:42:17,855 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:42:17,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 10 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 1 Unknown, 20 Unchecked, 3.6s Time] [2022-11-03 02:42:17,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-11-03 02:42:17,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-11-03 02:42:17,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:42:17,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-11-03 02:42:17,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2022-11-03 02:42:17,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:42:17,862 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-11-03 02:42:17,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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:42:17,863 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-11-03 02:42:17,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 02:42:17,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:42:17,863 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2022-11-03 02:42:17,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-03 02:42:18,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:42:18,067 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:42:18,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:42:18,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1555714486, now seen corresponding path program 3 times [2022-11-03 02:42:18,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:42:18,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145333945] [2022-11-03 02:42:18,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:42:18,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:42:18,078 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-03 02:42:18,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [963434040] [2022-11-03 02:42:18,078 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:42:18,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:42:18,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:42:18,080 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:42:18,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea0d5891-542d-42ee-b05e-9e3635ca8216/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:42:38,679 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:42:38,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:42:38,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 02:42:38,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:43:07,141 WARN L234 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:43:25,761 WARN L234 SmtUtils]: Spent 9.72s on a formula simplification. DAG size of input: 46 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:43:40,306 WARN L833 $PredicateComparison]: unable to prove that (and (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (and (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int)) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |v_ULTIMATE.start_gcd_test_~a#1_32|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |v_ULTIMATE.start_gcd_test_~a#1_32|) 256)))) (<= |v_ULTIMATE.start_gcd_test_~a#1_32| 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_32|)))) is different from false [2022-11-03 02:45:18,601 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse3 (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))) (let ((.cse0 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse3) 256))) (let ((.cse2 (mod .cse3 .cse0))) (let ((.cse1 (mod .cse2 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (<= .cse0 |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse1 127) (not (<= (mod (+ .cse2 (* 255 .cse0)) 256) 127)) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |v_ULTIMATE.start_gcd_test_~a#1_32|) 0) (not (= .cse3 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse1) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_32|))))))) is different from false [2022-11-03 02:45:43,547 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse2 (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))) (let ((.cse1 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse2) 256))) (let ((.cse0 (mod .cse2 .cse1))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (< 127 (mod (+ .cse0 (* 255 .cse1)) 256)) (= (mod .cse0 256) 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |v_ULTIMATE.start_gcd_test_~a#1_32|) 0) (not (= .cse2 0)) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_32|)))))) is different from false [2022-11-03 02:45:45,553 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_32| Int)) (let ((.cse2 (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |v_ULTIMATE.start_gcd_test_~a#1_32|) 256))) (let ((.cse1 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_32| .cse2) 256))) (let ((.cse0 (mod .cse2 .cse1))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (< 127 (mod (+ .cse0 (* 255 .cse1)) 256)) (= (mod .cse0 256) 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |v_ULTIMATE.start_gcd_test_~a#1_32|) 0) (not (= .cse2 0)) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_32|)))))) is different from true [2022-11-03 02:46:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 02:46:09,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:46:37,468 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse31 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse32 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse33 (mod (+ .cse31 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse18 (mod .cse31 256)) (.cse5 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse19 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse9 (<= .cse33 127)) (.cse4 (<= .cse32 127))) (let ((.cse6 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse33)) 256) 0))) (.cse0 (not .cse4)) (.cse11 (= .cse33 0)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse33) 256) 0))) (.cse13 (not .cse9)) (.cse15 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse32)) 0))) (.cse7 (not .cse19)) (.cse16 (= .cse32 0)) (.cse17 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse32) 0))) (.cse14 (not .cse5)) (.cse20 (<= .cse18 127))) (and (or (let ((.cse8 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse18)) 256) 0)) .cse19))) (let ((.cse1 (or .cse14 (and (or .cse7 .cse16 .cse17) .cse8))) (.cse3 (or .cse14 (and .cse8 (or .cse7 .cse15))))) (and (or (let ((.cse2 (or .cse5 (and (or .cse6 .cse7) .cse8)))) (and (or .cse0 (and .cse1 .cse2)) (or (and .cse3 .cse2) .cse4))) .cse9) (or (let ((.cse10 (or (and .cse8 (or .cse11 .cse12 .cse7)) .cse5))) (and (or (and .cse1 .cse10) .cse0) (or (and .cse10 .cse3) .cse4))) .cse13)))) .cse20) (or (let ((.cse24 (= .cse31 0))) (let ((.cse28 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse18)) (.cse27 (and .cse19 (not .cse24))) (.cse29 (= .cse18 0))) (let ((.cse30 (or (not (= .cse28 0)) .cse27 .cse29))) (let ((.cse22 (or (and .cse30 (or .cse24 .cse7 .cse16 .cse17)) .cse14)) (.cse23 (or .cse14 (and .cse30 (or .cse24 .cse7 .cse15)))) (.cse25 (or .cse27 (not (= (mod .cse28 256) 0)) .cse29))) (and (or .cse9 (let ((.cse21 (or .cse5 (and (or .cse24 .cse6 .cse7) .cse25)))) (and (or .cse0 (and .cse21 .cse22)) (or (and .cse23 .cse21) .cse4)))) (or (let ((.cse26 (or .cse5 (and (or .cse24 .cse11 .cse12 .cse7) .cse25)))) (and (or (and .cse26 .cse22) .cse0) (or .cse4 (and .cse23 .cse26)))) .cse13)))))) (not .cse20))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from false [2022-11-03 02:50:36,478 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse32 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse41 (mod (+ .cse32 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse48 (mod (+ .cse32 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse50 (+ (- 256) .cse48)) (.cse47 (+ (- 256) .cse41))) (let ((.cse46 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse47)) (.cse21 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse49 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse48) 256)) (.cse51 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse50) 256))) (let ((.cse25 (mod .cse32 256)) (.cse4 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse43 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse41)) (.cse11 (= .cse51 0)) (.cse12 (not (= 0 (mod .cse50 .cse51)))) (.cse8 (<= .cse41 127)) (.cse1 (<= .cse48 127)) (.cse16 (= .cse49 0)) (.cse17 (= .cse48 0)) (.cse18 (not (= (mod (mod .cse48 .cse49) 256) 0))) (.cse10 (not .cse21)) (.cse42 (* 255 .cse41)) (.cse44 (not (= (mod .cse47 (+ (mod (+ .cse46 .cse41) 256) (- 256))) 0))) (.cse45 (= .cse46 0))) (let ((.cse19 (and (or .cse44 (<= (mod (+ .cse46 .cse42) 256) 127)) (or .cse44 .cse45))) (.cse15 (or .cse16 .cse17 .cse18 .cse10)) (.cse20 (not .cse1)) (.cse14 (not .cse8)) (.cse5 (or .cse44 .cse10 .cse45)) (.cse2 (or .cse10 .cse11 .cse12)) (.cse28 (= .cse43 0)) (.cse29 (= .cse41 0)) (.cse30 (not (= (mod (mod .cse41 (+ (- 256) (mod (+ .cse42 .cse43) 256))) 256) 0))) (.cse7 (not .cse4)) (.cse0 (<= .cse25 127))) (and (or (not .cse0) (let ((.cse26 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse25))) (let ((.cse24 (<= (mod (+ .cse26 .cse25) 256) 127)) (.cse27 (= .cse25 0))) (let ((.cse9 (= .cse32 0)) (.cse6 (or .cse21 (let ((.cse31 (not (= (mod (mod .cse25 (+ (mod (+ .cse26 (* 255 .cse25)) 256) (- 256))) 256) 0)))) (and (or .cse31 .cse24) (or (= .cse26 0) .cse31))) .cse27))) (let ((.cse13 (or .cse7 (and (or .cse9 .cse28 .cse10 .cse29 .cse30) .cse6))) (.cse3 (or .cse21 (let ((.cse23 (mod .cse26 256))) (let ((.cse22 (not (= (mod (mod .cse25 .cse23) 256) 0)))) (and (or .cse22 (= .cse23 0)) (or .cse22 .cse24)))) .cse27))) (and (or .cse1 (and (or (and (or (and .cse2 .cse3) .cse4) (or (and .cse5 .cse6) .cse7)) .cse8) (or (and (or .cse4 (and (or .cse9 .cse10 .cse11 .cse12) .cse3)) .cse13) .cse14))) (or (and (or (and .cse13 (or (and .cse15 .cse3) .cse4)) .cse14) (or .cse8 (and (or .cse4 (and .cse3 (or .cse16 .cse9 .cse17 .cse18 .cse10))) (or .cse7 (and (or .cse9 .cse19 .cse10) .cse6))))) .cse20))))))) (or (let ((.cse39 (+ (- 256) .cse25))) (let ((.cse40 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse39))) (let ((.cse34 (or .cse21 (not (= (mod .cse39 (+ (- 256) (mod (+ .cse25 .cse40) 256))) 0)) (= .cse40 0)))) (let ((.cse35 (or (and (or .cse28 .cse10 .cse29 .cse30) .cse34) .cse7)) (.cse36 (let ((.cse38 (mod .cse40 256))) (or .cse21 (= .cse38 0) (not (= (mod .cse39 .cse38) 0)))))) (and (or (let ((.cse33 (or (and .cse15 .cse36) .cse4))) (and (or (and .cse33 (or (and (or .cse19 .cse10) .cse34) .cse7)) .cse8) (or .cse14 (and .cse33 .cse35)))) .cse20) (or .cse1 (let ((.cse37 (or (and .cse2 .cse36) .cse4))) (and (or .cse14 (and .cse37 .cse35)) (or (and .cse37 (or .cse7 (and .cse5 .cse34))) .cse8))))))))) .cse0)))))))) is different from false [2022-11-03 02:50:38,488 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse32 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse41 (mod (+ .cse32 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse48 (mod (+ .cse32 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse50 (+ (- 256) .cse48)) (.cse47 (+ (- 256) .cse41))) (let ((.cse46 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse47)) (.cse21 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse49 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse48) 256)) (.cse51 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse50) 256))) (let ((.cse25 (mod .cse32 256)) (.cse4 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse43 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse41)) (.cse11 (= .cse51 0)) (.cse12 (not (= 0 (mod .cse50 .cse51)))) (.cse8 (<= .cse41 127)) (.cse1 (<= .cse48 127)) (.cse16 (= .cse49 0)) (.cse17 (= .cse48 0)) (.cse18 (not (= (mod (mod .cse48 .cse49) 256) 0))) (.cse10 (not .cse21)) (.cse42 (* 255 .cse41)) (.cse44 (not (= (mod .cse47 (+ (mod (+ .cse46 .cse41) 256) (- 256))) 0))) (.cse45 (= .cse46 0))) (let ((.cse19 (and (or .cse44 (<= (mod (+ .cse46 .cse42) 256) 127)) (or .cse44 .cse45))) (.cse15 (or .cse16 .cse17 .cse18 .cse10)) (.cse20 (not .cse1)) (.cse14 (not .cse8)) (.cse5 (or .cse44 .cse10 .cse45)) (.cse2 (or .cse10 .cse11 .cse12)) (.cse28 (= .cse43 0)) (.cse29 (= .cse41 0)) (.cse30 (not (= (mod (mod .cse41 (+ (- 256) (mod (+ .cse42 .cse43) 256))) 256) 0))) (.cse7 (not .cse4)) (.cse0 (<= .cse25 127))) (and (or (not .cse0) (let ((.cse26 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse25))) (let ((.cse24 (<= (mod (+ .cse26 .cse25) 256) 127)) (.cse27 (= .cse25 0))) (let ((.cse9 (= .cse32 0)) (.cse6 (or .cse21 (let ((.cse31 (not (= (mod (mod .cse25 (+ (mod (+ .cse26 (* 255 .cse25)) 256) (- 256))) 256) 0)))) (and (or .cse31 .cse24) (or (= .cse26 0) .cse31))) .cse27))) (let ((.cse13 (or .cse7 (and (or .cse9 .cse28 .cse10 .cse29 .cse30) .cse6))) (.cse3 (or .cse21 (let ((.cse23 (mod .cse26 256))) (let ((.cse22 (not (= (mod (mod .cse25 .cse23) 256) 0)))) (and (or .cse22 (= .cse23 0)) (or .cse22 .cse24)))) .cse27))) (and (or .cse1 (and (or (and (or (and .cse2 .cse3) .cse4) (or (and .cse5 .cse6) .cse7)) .cse8) (or (and (or .cse4 (and (or .cse9 .cse10 .cse11 .cse12) .cse3)) .cse13) .cse14))) (or (and (or (and .cse13 (or (and .cse15 .cse3) .cse4)) .cse14) (or .cse8 (and (or .cse4 (and .cse3 (or .cse16 .cse9 .cse17 .cse18 .cse10))) (or .cse7 (and (or .cse9 .cse19 .cse10) .cse6))))) .cse20))))))) (or (let ((.cse39 (+ (- 256) .cse25))) (let ((.cse40 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse39))) (let ((.cse34 (or .cse21 (not (= (mod .cse39 (+ (- 256) (mod (+ .cse25 .cse40) 256))) 0)) (= .cse40 0)))) (let ((.cse35 (or (and (or .cse28 .cse10 .cse29 .cse30) .cse34) .cse7)) (.cse36 (let ((.cse38 (mod .cse40 256))) (or .cse21 (= .cse38 0) (not (= (mod .cse39 .cse38) 0)))))) (and (or (let ((.cse33 (or (and .cse15 .cse36) .cse4))) (and (or (and .cse33 (or (and (or .cse19 .cse10) .cse34) .cse7)) .cse8) (or .cse14 (and .cse33 .cse35)))) .cse20) (or .cse1 (let ((.cse37 (or (and .cse2 .cse36) .cse4))) (and (or .cse14 (and .cse37 .cse35)) (or (and .cse37 (or .cse7 (and .cse5 .cse34))) .cse8))))))))) .cse0)))))))) is different from true