./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_1+newton_3_7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_1+newton_3_7.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 61ffc5d3104f879fcd66a8ed550fe0d20a910c87b717c72a3dc729bb40cff29b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 21:20:28,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 21:20:28,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 21:20:28,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 21:20:28,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 21:20:28,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 21:20:28,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 21:20:28,470 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 21:20:28,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 21:20:28,479 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 21:20:28,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 21:20:28,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 21:20:28,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 21:20:28,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 21:20:28,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 21:20:28,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 21:20:28,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 21:20:28,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 21:20:28,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 21:20:28,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 21:20:28,494 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 21:20:28,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 21:20:28,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 21:20:28,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 21:20:28,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 21:20:28,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 21:20:28,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 21:20:28,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 21:20:28,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 21:20:28,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 21:20:28,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 21:20:28,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 21:20:28,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 21:20:28,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 21:20:28,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 21:20:28,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 21:20:28,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 21:20:28,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 21:20:28,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 21:20:28,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 21:20:28,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 21:20:28,529 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-20 21:20:28,570 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 21:20:28,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 21:20:28,571 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 21:20:28,571 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 21:20:28,571 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 21:20:28,571 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 21:20:28,572 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 21:20:28,572 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 21:20:28,572 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 21:20:28,572 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 21:20:28,572 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 21:20:28,573 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 21:20:28,573 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 21:20:28,573 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 21:20:28,573 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 21:20:28,573 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 21:20:28,573 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 21:20:28,574 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 21:20:28,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 21:20:28,574 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 21:20:28,575 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 21:20:28,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 21:20:28,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 21:20:28,575 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 21:20:28,575 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 21:20:28,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 21:20:28,576 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 21:20:28,576 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 21:20:28,581 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 21:20:28,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 21:20:28,582 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 21:20:28,582 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 21:20:28,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 21:20:28,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 21:20:28,583 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 21:20:28,583 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 21:20:28,584 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 21:20:28,584 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 21:20:28,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 21:20:28,584 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 21:20:28,584 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 21:20:28,585 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_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 61ffc5d3104f879fcd66a8ed550fe0d20a910c87b717c72a3dc729bb40cff29b [2022-11-20 21:20:28,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 21:20:28,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 21:20:28,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 21:20:28,928 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 21:20:28,928 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 21:20:28,930 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/combinations/gcd_1+newton_3_7.i [2022-11-20 21:20:31,911 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 21:20:32,155 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 21:20:32,155 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/sv-benchmarks/c/combinations/gcd_1+newton_3_7.i [2022-11-20 21:20:32,164 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/data/f9b0ed24d/22fb1f09fd814686aa3d8c8656ecd2b8/FLAG8e580caf6 [2022-11-20 21:20:32,178 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/data/f9b0ed24d/22fb1f09fd814686aa3d8c8656ecd2b8 [2022-11-20 21:20:32,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 21:20:32,182 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 21:20:32,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 21:20:32,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 21:20:32,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 21:20:32,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:20:32" (1/1) ... [2022-11-20 21:20:32,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24111199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:32, skipping insertion in model container [2022-11-20 21:20:32,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:20:32" (1/1) ... [2022-11-20 21:20:32,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 21:20:32,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 21:20:32,426 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/sv-benchmarks/c/combinations/gcd_1+newton_3_7.i[1226,1239] [2022-11-20 21:20:32,448 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/sv-benchmarks/c/combinations/gcd_1+newton_3_7.i[2828,2841] [2022-11-20 21:20:32,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 21:20:32,460 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 21:20:32,471 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/sv-benchmarks/c/combinations/gcd_1+newton_3_7.i[1226,1239] [2022-11-20 21:20:32,481 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/sv-benchmarks/c/combinations/gcd_1+newton_3_7.i[2828,2841] [2022-11-20 21:20:32,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 21:20:32,496 INFO L208 MainTranslator]: Completed translation [2022-11-20 21:20:32,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:32 WrapperNode [2022-11-20 21:20:32,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 21:20:32,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 21:20:32,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 21:20:32,499 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 21:20:32,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:32" (1/1) ... [2022-11-20 21:20:32,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:32" (1/1) ... [2022-11-20 21:20:32,533 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 90 [2022-11-20 21:20:32,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 21:20:32,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 21:20:32,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 21:20:32,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 21:20:32,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:32" (1/1) ... [2022-11-20 21:20:32,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:32" (1/1) ... [2022-11-20 21:20:32,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:32" (1/1) ... [2022-11-20 21:20:32,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:32" (1/1) ... [2022-11-20 21:20:32,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:32" (1/1) ... [2022-11-20 21:20:32,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:32" (1/1) ... [2022-11-20 21:20:32,573 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:32" (1/1) ... [2022-11-20 21:20:32,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:32" (1/1) ... [2022-11-20 21:20:32,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 21:20:32,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 21:20:32,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 21:20:32,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 21:20:32,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:32" (1/1) ... [2022-11-20 21:20:32,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 21:20:32,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:20:32,626 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 21:20:32,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 21:20:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 21:20:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-20 21:20:32,679 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-20 21:20:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-20 21:20:32,679 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-20 21:20:32,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 21:20:32,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 21:20:32,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 21:20:32,772 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 21:20:32,774 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 21:20:32,985 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 21:20:33,107 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 21:20:33,107 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 21:20:33,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:20:33 BoogieIcfgContainer [2022-11-20 21:20:33,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 21:20:33,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 21:20:33,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 21:20:33,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 21:20:33,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:20:32" (1/3) ... [2022-11-20 21:20:33,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7875f9c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:20:33, skipping insertion in model container [2022-11-20 21:20:33,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:20:32" (2/3) ... [2022-11-20 21:20:33,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7875f9c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:20:33, skipping insertion in model container [2022-11-20 21:20:33,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:20:33" (3/3) ... [2022-11-20 21:20:33,136 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_3_7.i [2022-11-20 21:20:33,158 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 21:20:33,159 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 21:20:33,236 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 21:20:33,246 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;@441bc45c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 21:20:33,246 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-20 21:20:33,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 21:20:33,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 21:20:33,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:20:33,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 21:20:33,262 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:20:33,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:20:33,270 INFO L85 PathProgramCache]: Analyzing trace with hash -391407110, now seen corresponding path program 1 times [2022-11-20 21:20:33,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:20:33,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114090076] [2022-11-20 21:20:33,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:20:33,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:20:33,410 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 21:20:33,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1354948308] [2022-11-20 21:20:33,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:20:33,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:20:33,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:20:33,420 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:20:33,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 21:20:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:20:33,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 21:20:33,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:20:33,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:20:33,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 21:20:33,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:20:33,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114090076] [2022-11-20 21:20:33,666 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 21:20:33,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354948308] [2022-11-20 21:20:33,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354948308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:20:33,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:20:33,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 21:20:33,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082825108] [2022-11-20 21:20:33,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:20:33,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 21:20:33,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:20:33,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 21:20:33,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:20:33,727 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:20:33,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:20:33,804 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-11-20 21:20:33,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 21:20:33,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-20 21:20:33,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:20:33,815 INFO L225 Difference]: With dead ends: 37 [2022-11-20 21:20:33,815 INFO L226 Difference]: Without dead ends: 24 [2022-11-20 21:20:33,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:20:33,826 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 21:20:33,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 21:20:33,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-20 21:20:33,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-20 21:20:33,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 21:20:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-11-20 21:20:33,874 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 6 [2022-11-20 21:20:33,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:20:33,875 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-11-20 21:20:33,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:20:33,875 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-11-20 21:20:33,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 21:20:33,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:20:33,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:20:33,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 21:20:34,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-20 21:20:34,084 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:20:34,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:20:34,084 INFO L85 PathProgramCache]: Analyzing trace with hash 749024068, now seen corresponding path program 1 times [2022-11-20 21:20:34,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:20:34,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70440366] [2022-11-20 21:20:34,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:20:34,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:20:34,103 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 21:20:34,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [71607268] [2022-11-20 21:20:34,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:20:34,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:20:34,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:20:34,106 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:20:34,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 21:20:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:20:34,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 21:20:34,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:20:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:20:34,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:20:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:20:34,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:20:34,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70440366] [2022-11-20 21:20:34,365 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 21:20:34,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71607268] [2022-11-20 21:20:34,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71607268] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:20:34,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1188416080] [2022-11-20 21:20:34,390 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-20 21:20:34,390 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:20:34,394 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 21:20:34,402 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 21:20:34,403 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 21:20:34,724 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 21:20:35,131 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '180#(and (= |ULTIMATE.start_gcd_test_~b#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~y~0#1|) 1 0)) (<= 0 (+ |ULTIMATE.start_gcd_test_#res#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) (<= 0 |ULTIMATE.start_main1_~y~0#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_gcd_test_#in~b#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (<= 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|) (<= |ULTIMATE.start_main1_~y~0#1| 127) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-20 21:20:35,131 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 21:20:35,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:20:35,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-20 21:20:35,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602209258] [2022-11-20 21:20:35,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:20:35,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 21:20:35,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:20:35,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 21:20:35,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-20 21:20:35,134 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 8 states, 8 states have (on average 1.375) 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-20 21:20:35,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:20:35,200 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-11-20 21:20:35,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 21:20:35,201 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) 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) Word has length 7 [2022-11-20 21:20:35,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:20:35,202 INFO L225 Difference]: With dead ends: 28 [2022-11-20 21:20:35,202 INFO L226 Difference]: Without dead ends: 25 [2022-11-20 21:20:35,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-20 21:20:35,204 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 21:20:35,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 96 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 21:20:35,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-20 21:20:35,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-20 21:20:35,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 21:20:35,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-11-20 21:20:35,210 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 7 [2022-11-20 21:20:35,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:20:35,211 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-11-20 21:20:35,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) 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-20 21:20:35,211 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-11-20 21:20:35,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 21:20:35,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:20:35,212 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-20 21:20:35,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 21:20:35,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:20:35,418 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:20:35,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:20:35,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1742652218, now seen corresponding path program 2 times [2022-11-20 21:20:35,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:20:35,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310106825] [2022-11-20 21:20:35,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:20:35,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:20:35,430 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 21:20:35,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1740443061] [2022-11-20 21:20:35,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:20:35,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:20:35,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:20:35,435 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:20:35,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 21:20:46,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 21:20:46,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:20:46,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-20 21:20:46,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:21:08,033 WARN L233 SmtUtils]: Spent 6.37s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:21:27,131 WARN L233 SmtUtils]: Spent 9.37s on a formula simplification. DAG size of input: 47 DAG size of output: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:21:49,275 WARN L837 $PredicateComparison]: unable to prove that (and (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int)) (let ((.cse0 (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse0) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (not (= 0 .cse0)) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse0))))) is different from false [2022-11-20 21:22:20,467 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main1_~y~0#1| Int) (|ULTIMATE.start_gcd_test_#in~a#1| Int)) (let ((.cse0 (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |ULTIMATE.start_main1_~y~0#1|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |ULTIMATE.start_main1_~y~0#1|) 0) (< 0 |ULTIMATE.start_main1_~y~0#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (mod (mod |ULTIMATE.start_main1_~y~0#1| .cse0) 256) 0) (not (= .cse0 0))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) is different from false [2022-11-20 21:22:41,016 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main1_~y~0#1| Int) (|ULTIMATE.start_gcd_test_#in~a#1| Int)) (let ((.cse0 (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |ULTIMATE.start_main1_~y~0#1|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |ULTIMATE.start_main1_~y~0#1|) 0) (< 0 |ULTIMATE.start_main1_~y~0#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (mod (mod |ULTIMATE.start_main1_~y~0#1| .cse0) 256) 0) (not (= .cse0 0))))) is different from false [2022-11-20 21:22:43,023 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main1_~y~0#1| Int) (|ULTIMATE.start_gcd_test_#in~a#1| Int)) (let ((.cse0 (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |ULTIMATE.start_main1_~y~0#1|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |ULTIMATE.start_main1_~y~0#1|) 0) (< 0 |ULTIMATE.start_main1_~y~0#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (mod (mod |ULTIMATE.start_main1_~y~0#1| .cse0) 256) 0) (not (= .cse0 0))))) is different from true [2022-11-20 21:22:43,024 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-20 21:22:43,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:27:09,467 WARN L233 SmtUtils]: Spent 3.22m on a formula simplification that was a NOOP. DAG size: 124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:27:32,413 WARN L859 $PredicateComparison]: unable to prove that (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse3 (<= .cse2 127))) (and (or (let ((.cse1 (mod (+ .cse2 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse0 (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse1 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)))) (and (or .cse0 (= .cse1 0)) (or .cse0 (<= (mod .cse1 256) 127))))) .cse3) (let ((.cse4 (mod (mod .cse2 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (not .cse3) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse4) 256) 0)) (= .cse4 0)))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0))) is different from true [2022-11-20 21:28:17,138 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main1_~y~0#1_12| Int) (|v_ULTIMATE.start_main1_~x~0#1_7| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_main1_~x~0#1_7|) 256) |v_ULTIMATE.start_main1_~y~0#1_12|) 256))) (or (not (= 0 (mod (mod |v_ULTIMATE.start_main1_~y~0#1_12| .cse0) 256))) (<= 0 |v_ULTIMATE.start_main1_~x~0#1_7|) (< (+ 128 |v_ULTIMATE.start_main1_~x~0#1_7|) 0) (<= |v_ULTIMATE.start_main1_~y~0#1_12| 0) (not (= (mod |v_ULTIMATE.start_main1_~x~0#1_7| |v_ULTIMATE.start_main1_~y~0#1_12|) 0)) (= .cse0 0)))) is different from false [2022-11-20 21:28:19,142 WARN L859 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main1_~y~0#1_12| Int) (|v_ULTIMATE.start_main1_~x~0#1_7| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_main1_~x~0#1_7|) 256) |v_ULTIMATE.start_main1_~y~0#1_12|) 256))) (or (not (= 0 (mod (mod |v_ULTIMATE.start_main1_~y~0#1_12| .cse0) 256))) (<= 0 |v_ULTIMATE.start_main1_~x~0#1_7|) (< (+ 128 |v_ULTIMATE.start_main1_~x~0#1_7|) 0) (<= |v_ULTIMATE.start_main1_~y~0#1_12| 0) (not (= (mod |v_ULTIMATE.start_main1_~x~0#1_7| |v_ULTIMATE.start_main1_~y~0#1_12|) 0)) (= .cse0 0)))) is different from true [2022-11-20 21:28:19,142 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-20 21:28:19,143 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:28:19,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310106825] [2022-11-20 21:28:19,143 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 21:28:19,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740443061] [2022-11-20 21:28:19,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740443061] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:28:19,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1457831464] [2022-11-20 21:28:19,145 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-20 21:28:19,145 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:28:19,145 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 21:28:19,146 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 21:28:19,146 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 21:28:19,265 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 21:28:32,076 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '318#(and (= |ULTIMATE.start_gcd_test_~b#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~y~0#1|) 1 0)) (<= 0 (+ |ULTIMATE.start_gcd_test_#res#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) (<= 0 |ULTIMATE.start_main1_~y~0#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_gcd_test_#in~b#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (<= 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|) (<= |ULTIMATE.start_main1_~y~0#1| 127) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-20 21:28:32,076 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 21:28:32,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 21:28:32,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2022-11-20 21:28:32,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940056522] [2022-11-20 21:28:32,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 21:28:32,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 21:28:32,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:28:32,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 21:28:32,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=138, Unknown=14, NotChecked=140, Total=342 [2022-11-20 21:28:32,078 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:28:33,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-20 21:29:36,352 WARN L233 SmtUtils]: Spent 48.68s on a formula simplification. DAG size of input: 51 DAG size of output: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:29:38,410 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|) (or (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int)) (let ((.cse0 (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (not (<= .cse0 127)) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse0)))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (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) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (<= .cse1 127) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse1))))) (or (let ((.cse34 (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)) (.cse35 (mod (+ .cse34 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse36 (mod (+ .cse34 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse20 (mod .cse34 256)) (.cse7 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse11 (<= .cse36 127)) (.cse2 (<= .cse35 127)) (.cse27 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse35) 256) 0))) (.cse29 (= .cse35 0)) (.cse30 (= |c_ULTIMATE.start_main1_~y~0#1| .cse35)) (.cse31 (= .cse36 0)) (.cse32 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse36) 256) 0))) (.cse15 (not .cse21)) (.cse33 (= |c_ULTIMATE.start_main1_~y~0#1| .cse36)) (.cse22 (+ |c_ULTIMATE.start_main1_~y~0#1| 256))) (let ((.cse13 (= .cse36 .cse22)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse36)) 256) 0))) (.cse8 (or .cse31 .cse32 .cse15 .cse33)) (.cse19 (or .cse27 .cse15 .cse29 .cse30)) (.cse5 (not .cse2)) (.cse10 (not .cse11)) (.cse16 (not .cse7)) (.cse17 (= .cse35 .cse22)) (.cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse35)) 256) 0))) (.cse23 (<= .cse20 127))) (and (or (let ((.cse9 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse20)) 256) 0)) .cse21 (= .cse20 .cse22)))) (let ((.cse6 (or .cse16 (and .cse19 .cse9))) (.cse3 (or .cse16 (and .cse9 (or .cse17 .cse18 .cse15))))) (and (or (let ((.cse4 (or .cse7 (and .cse8 .cse9)))) (and (or .cse2 (and .cse3 .cse4)) (or .cse5 (and .cse6 .cse4)))) .cse10) (or .cse11 (let ((.cse12 (or (and .cse9 (or .cse13 .cse14 .cse15)) .cse7))) (and (or .cse5 (and .cse12 .cse6)) (or .cse2 (and .cse12 .cse3)))))))) .cse23) (or (let ((.cse26 (or .cse21 (= |c_ULTIMATE.start_main1_~y~0#1| .cse20) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse20) 256) 0)) (= .cse20 0))) (.cse28 (= .cse34 0))) (let ((.cse24 (or .cse16 (and .cse26 (or .cse28 .cse17 .cse18 .cse15))))) (and (or .cse11 (let ((.cse25 (or (and .cse26 (or .cse28 .cse13 .cse14 .cse15)) .cse7))) (and (or (and .cse24 .cse25) .cse2) (or (and (or .cse16 (and .cse26 (or .cse27 .cse28 .cse15 .cse29 .cse30))) .cse25) .cse5)))) (or (and (or (and (or (and .cse8 .cse26) .cse7) (or .cse16 (and .cse26 .cse19))) .cse5) (or .cse2 (and (or (and .cse26 (or .cse28 .cse31 .cse32 .cse15 .cse33)) .cse7) .cse24))) .cse10)))) (not .cse23))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) is different from false [2022-11-20 21:29:40,415 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|) (or (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int)) (let ((.cse0 (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (not (<= .cse0 127)) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse0)))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (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) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (<= .cse1 127) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse1))))) (or (let ((.cse34 (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)) (.cse35 (mod (+ .cse34 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse36 (mod (+ .cse34 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse20 (mod .cse34 256)) (.cse7 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse11 (<= .cse36 127)) (.cse2 (<= .cse35 127)) (.cse27 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse35) 256) 0))) (.cse29 (= .cse35 0)) (.cse30 (= |c_ULTIMATE.start_main1_~y~0#1| .cse35)) (.cse31 (= .cse36 0)) (.cse32 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse36) 256) 0))) (.cse15 (not .cse21)) (.cse33 (= |c_ULTIMATE.start_main1_~y~0#1| .cse36)) (.cse22 (+ |c_ULTIMATE.start_main1_~y~0#1| 256))) (let ((.cse13 (= .cse36 .cse22)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse36)) 256) 0))) (.cse8 (or .cse31 .cse32 .cse15 .cse33)) (.cse19 (or .cse27 .cse15 .cse29 .cse30)) (.cse5 (not .cse2)) (.cse10 (not .cse11)) (.cse16 (not .cse7)) (.cse17 (= .cse35 .cse22)) (.cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse35)) 256) 0))) (.cse23 (<= .cse20 127))) (and (or (let ((.cse9 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse20)) 256) 0)) .cse21 (= .cse20 .cse22)))) (let ((.cse6 (or .cse16 (and .cse19 .cse9))) (.cse3 (or .cse16 (and .cse9 (or .cse17 .cse18 .cse15))))) (and (or (let ((.cse4 (or .cse7 (and .cse8 .cse9)))) (and (or .cse2 (and .cse3 .cse4)) (or .cse5 (and .cse6 .cse4)))) .cse10) (or .cse11 (let ((.cse12 (or (and .cse9 (or .cse13 .cse14 .cse15)) .cse7))) (and (or .cse5 (and .cse12 .cse6)) (or .cse2 (and .cse12 .cse3)))))))) .cse23) (or (let ((.cse26 (or .cse21 (= |c_ULTIMATE.start_main1_~y~0#1| .cse20) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse20) 256) 0)) (= .cse20 0))) (.cse28 (= .cse34 0))) (let ((.cse24 (or .cse16 (and .cse26 (or .cse28 .cse17 .cse18 .cse15))))) (and (or .cse11 (let ((.cse25 (or (and .cse26 (or .cse28 .cse13 .cse14 .cse15)) .cse7))) (and (or (and .cse24 .cse25) .cse2) (or (and (or .cse16 (and .cse26 (or .cse27 .cse28 .cse15 .cse29 .cse30))) .cse25) .cse5)))) (or (and (or (and (or (and .cse8 .cse26) .cse7) (or .cse16 (and .cse26 .cse19))) .cse5) (or .cse2 (and (or (and .cse26 (or .cse28 .cse31 .cse32 .cse15 .cse33)) .cse7) .cse24))) .cse10)))) (not .cse23))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) is different from true [2022-11-20 21:29:43,261 WARN L837 $PredicateComparison]: unable to prove that (and (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int)) (let ((.cse0 (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse0) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (not (= 0 .cse0)) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse0)))) (or (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~a#1|) (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128))))) is different from false [2022-11-20 21:29:45,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-20 21:29:45,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:29:45,099 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-11-20 21:29:45,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 21:29:45,099 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-20 21:29:45,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:29:45,100 INFO L225 Difference]: With dead ends: 29 [2022-11-20 21:29:45,100 INFO L226 Difference]: Without dead ends: 26 [2022-11-20 21:29:45,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 319.5s TimeCoverageRelationStatistics Valid=57, Invalid=158, Unknown=23, NotChecked=224, Total=462 [2022-11-20 21:29:45,104 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:29:45,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 169 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 87 Unchecked, 4.3s Time] [2022-11-20 21:29:45,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-20 21:29:45,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-20 21:29:45,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-20 21:29:45,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-11-20 21:29:45,114 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 8 [2022-11-20 21:29:45,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:29:45,115 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-11-20 21:29:45,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:29:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-11-20 21:29:45,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 21:29:45,116 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:29:45,116 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2022-11-20 21:29:45,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-20 21:29:45,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:29:45,321 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 21:29:45,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:29:45,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1814613500, now seen corresponding path program 3 times [2022-11-20 21:29:45,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:29:45,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817344329] [2022-11-20 21:29:45,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:29:45,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:29:45,333 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 21:29:45,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1730036391] [2022-11-20 21:29:45,334 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 21:29:45,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:29:45,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:29:45,338 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:29:45,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2f1b67c-246b-43a0-9c95-5d85fc7dd9bc/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 21:29:53,270 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 21:29:53,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:29:53,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-20 21:29:53,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:30:18,024 WARN L233 SmtUtils]: Spent 7.62s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:30:29,650 WARN L233 SmtUtils]: Spent 7.11s on a formula simplification. DAG size of input: 43 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 21:31:23,772 WARN L837 $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 ((|ULTIMATE.start_gcd_test_#in~a#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |v_ULTIMATE.start_gcd_test_~a#1_33|) 256) |c_ULTIMATE.start_gcd_test_~a#1|)))) is different from false [2022-11-20 21:32:03,721 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse0 (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |v_ULTIMATE.start_gcd_test_~a#1_33|) 256))) (let ((.cse1 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse0) 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_33|) 0) (not (= .cse0 0)) (= (mod (mod .cse0 .cse1) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (not (= .cse1 0)) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_33|))))) is different from false [2022-11-20 21:32:28,505 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse0 (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |v_ULTIMATE.start_gcd_test_~a#1_33|) 256))) (let ((.cse1 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse0) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod (mod .cse0 .cse1) 256) 0) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) 0) (not (= .cse0 0)) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (not (= .cse1 0)) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_33|))))) is different from false [2022-11-20 21:32:30,507 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse0 (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |v_ULTIMATE.start_gcd_test_~a#1_33|) 256))) (let ((.cse1 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse0) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod (mod .cse0 .cse1) 256) 0) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) 0) (not (= .cse0 0)) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (not (= .cse1 0)) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_33|))))) is different from true [2022-11-20 21:32:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-20 21:32:53,842 INFO L328 TraceCheckSpWp]: Computing backward predicates...