./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_2_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 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_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW --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 add45819e4621ede17512a8acbf89201f3f4db1ab1bf97afdd66c20e4064e4cd --- 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-4e7fbc6 [2022-11-23 14:25:59,282 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:25:59,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:25:59,332 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:25:59,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:25:59,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:25:59,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:25:59,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:25:59,343 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:25:59,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:25:59,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:25:59,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:25:59,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:25:59,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:25:59,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:25:59,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:25:59,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:25:59,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:25:59,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:25:59,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:25:59,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:25:59,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:25:59,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:25:59,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:25:59,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:25:59,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:25:59,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:25:59,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:25:59,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:25:59,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:25:59,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:25:59,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:25:59,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:25:59,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:25:59,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:25:59,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:25:59,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:25:59,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:25:59,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:25:59,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:25:59,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:25:59,387 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 14:25:59,423 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:25:59,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:25:59,424 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:25:59,424 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:25:59,425 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:25:59,425 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:25:59,425 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:25:59,426 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:25:59,426 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:25:59,426 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:25:59,427 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:25:59,427 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:25:59,428 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:25:59,428 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:25:59,428 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:25:59,428 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:25:59,429 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:25:59,429 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:25:59,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:25:59,430 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:25:59,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:25:59,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:25:59,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:25:59,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 14:25:59,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:25:59,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 14:25:59,432 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:25:59,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 14:25:59,432 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:25:59,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 14:25:59,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:25:59,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:25:59,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:25:59,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:25:59,434 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:25:59,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:25:59,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 14:25:59,435 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:25:59,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:25:59,435 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 14:25:59,435 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:25:59,436 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_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/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_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW 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 -> add45819e4621ede17512a8acbf89201f3f4db1ab1bf97afdd66c20e4064e4cd [2022-11-23 14:25:59,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:25:59,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:25:59,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:25:59,796 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:25:59,796 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:25:59,798 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/combinations/gcd_2+newton_2_4.i [2022-11-23 14:26:02,804 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:26:02,991 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:26:02,992 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/sv-benchmarks/c/combinations/gcd_2+newton_2_4.i [2022-11-23 14:26:02,999 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/data/669c8f184/4005f2fb5ba041f49c23f794e45905b9/FLAG681478a5b [2022-11-23 14:26:03,013 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/data/669c8f184/4005f2fb5ba041f49c23f794e45905b9 [2022-11-23 14:26:03,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:26:03,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:26:03,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:26:03,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:26:03,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:26:03,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:26:03" (1/1) ... [2022-11-23 14:26:03,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6948d8df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:03, skipping insertion in model container [2022-11-23 14:26:03,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:26:03" (1/1) ... [2022-11-23 14:26:03,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:26:03,051 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:26:03,247 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_bcf24615-72d1-4722-94f6-b1b6d747712b/sv-benchmarks/c/combinations/gcd_2+newton_2_4.i[1226,1239] [2022-11-23 14:26:03,295 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_bcf24615-72d1-4722-94f6-b1b6d747712b/sv-benchmarks/c/combinations/gcd_2+newton_2_4.i[2841,2854] [2022-11-23 14:26:03,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:26:03,318 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:26:03,340 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_bcf24615-72d1-4722-94f6-b1b6d747712b/sv-benchmarks/c/combinations/gcd_2+newton_2_4.i[1226,1239] [2022-11-23 14:26:03,369 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_bcf24615-72d1-4722-94f6-b1b6d747712b/sv-benchmarks/c/combinations/gcd_2+newton_2_4.i[2841,2854] [2022-11-23 14:26:03,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:26:03,390 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:26:03,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:03 WrapperNode [2022-11-23 14:26:03,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:26:03,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:26:03,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:26:03,392 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:26:03,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:03" (1/1) ... [2022-11-23 14:26:03,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:03" (1/1) ... [2022-11-23 14:26:03,438 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2022-11-23 14:26:03,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:26:03,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:26:03,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:26:03,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:26:03,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:03" (1/1) ... [2022-11-23 14:26:03,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:03" (1/1) ... [2022-11-23 14:26:03,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:03" (1/1) ... [2022-11-23 14:26:03,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:03" (1/1) ... [2022-11-23 14:26:03,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:03" (1/1) ... [2022-11-23 14:26:03,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:03" (1/1) ... [2022-11-23 14:26:03,495 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:03" (1/1) ... [2022-11-23 14:26:03,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:03" (1/1) ... [2022-11-23 14:26:03,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:26:03,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:26:03,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:26:03,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:26:03,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:03" (1/1) ... [2022-11-23 14:26:03,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:26:03,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:26:03,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:26:03,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:26:03,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:26:03,578 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-23 14:26:03,579 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-23 14:26:03,579 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-23 14:26:03,579 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-23 14:26:03,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 14:26:03,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:26:03,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:26:03,655 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:26:03,658 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:26:03,829 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:26:03,890 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:26:03,891 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 14:26:03,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:26:03 BoogieIcfgContainer [2022-11-23 14:26:03,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:26:03,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:26:03,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:26:03,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:26:03,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:26:03" (1/3) ... [2022-11-23 14:26:03,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45eeaef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:26:03, skipping insertion in model container [2022-11-23 14:26:03,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:03" (2/3) ... [2022-11-23 14:26:03,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45eeaef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:26:03, skipping insertion in model container [2022-11-23 14:26:03,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:26:03" (3/3) ... [2022-11-23 14:26:03,903 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_4.i [2022-11-23 14:26:03,941 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:26:03,941 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 14:26:03,992 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:26:03,998 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;@6e5fecd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:26:03,999 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-23 14:26:04,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 14:26:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 14:26:04,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:04,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 14:26:04,015 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:26:04,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:04,021 INFO L85 PathProgramCache]: Analyzing trace with hash -499021812, now seen corresponding path program 1 times [2022-11-23 14:26:04,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:04,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144689464] [2022-11-23 14:26:04,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:04,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:04,438 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-23 14:26:04,438 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:26:04,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144689464] [2022-11-23 14:26:04,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144689464] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:04,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:04,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:26:04,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46690215] [2022-11-23 14:26:04,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:04,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:26:04,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:26:04,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:26:04,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:26:04,476 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:04,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:04,569 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-11-23 14:26:04,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:26:04,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-23 14:26:04,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:04,578 INFO L225 Difference]: With dead ends: 38 [2022-11-23 14:26:04,578 INFO L226 Difference]: Without dead ends: 21 [2022-11-23 14:26:04,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:26:04,588 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:04,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 35 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:26:04,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-23 14:26:04,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-23 14:26:04,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 14:26:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-11-23 14:26:04,660 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 6 [2022-11-23 14:26:04,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:04,660 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-11-23 14:26:04,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-11-23 14:26:04,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 14:26:04,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:04,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:04,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 14:26:04,663 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:26:04,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:04,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1643785969, now seen corresponding path program 1 times [2022-11-23 14:26:04,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:04,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250633573] [2022-11-23 14:26:04,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:04,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:04,698 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:26:04,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1068311541] [2022-11-23 14:26:04,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:04,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:26:04,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:26:04,715 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:26:04,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 14:26:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:04,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 14:26:04,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:05,284 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-23 14:26:05,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:26:05,393 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-23 14:26:05,394 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:26:05,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250633573] [2022-11-23 14:26:05,394 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:26:05,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068311541] [2022-11-23 14:26:05,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068311541] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:26:05,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1344731225] [2022-11-23 14:26:05,429 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-23 14:26:05,430 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:26:05,443 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:26:05,452 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:26:05,453 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:26:05,723 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:26:06,133 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '160#(and (= |ULTIMATE.start_gcd_test_~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (<= |ULTIMATE.start_gcd_test_#in~a#1| 127) (<= |ULTIMATE.start_main1_~x~0#1| 127) (<= |ULTIMATE.start_gcd_test_#in~b#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (< 0 |ULTIMATE.start_main1_~y~0#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (ite (<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~y~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 (+ |ULTIMATE.start_main1_~x~0#1| 128)) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_#res#1|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-23 14:26:06,133 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:26:06,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:26:06,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-23 14:26:06,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581327011] [2022-11-23 14:26:06,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:26:06,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 14:26:06,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:26:06,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 14:26:06,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-11-23 14:26:06,136 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:06,395 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-11-23 14:26:06,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 14:26:06,396 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-23 14:26:06,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:06,397 INFO L225 Difference]: With dead ends: 28 [2022-11-23 14:26:06,397 INFO L226 Difference]: Without dead ends: 23 [2022-11-23 14:26:06,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2022-11-23 14:26:06,399 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:06,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 96 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:26:06,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-23 14:26:06,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-23 14:26:06,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 14:26:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-11-23 14:26:06,406 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 7 [2022-11-23 14:26:06,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:06,407 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-11-23 14:26:06,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-11-23 14:26:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 14:26:06,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:06,408 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:06,418 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-23 14:26:06,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:26:06,619 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:26:06,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:06,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1300293201, now seen corresponding path program 2 times [2022-11-23 14:26:06,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:06,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856276666] [2022-11-23 14:26:06,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:06,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:06,629 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:26:06,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2139721393] [2022-11-23 14:26:06,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:26:06,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:26:06,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:26:06,631 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:26:06,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 14:26:06,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 14:26:06,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:26:06,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-23 14:26:06,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:13,919 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse20 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse11 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256))) (let ((.cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse73 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse74 (mod .cse73 256))) (and (not (<= (mod (+ .cse73 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= .cse11 .cse74) (not (<= .cse74 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0))))))) (.cse31 (not .cse6)) (.cse24 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse72 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse71 (mod .cse72 256))) (and (= .cse11 .cse71) (not (<= .cse71 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (not (<= (mod (+ .cse72 .cse20) 256) 127))))))) (.cse53 (< |c_ULTIMATE.start_main1_~y~0#1| 0)) (.cse3 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse2 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (and (let ((.cse4 (mod .cse2 256))) (let ((.cse5 (<= .cse4 127))) (or (and (let ((.cse0 (+ .cse4 (- 256)))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse0) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse0))) (and (not (= .cse1 0)) (= (mod (+ .cse1 .cse2) 256) .cse3) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (not .cse5) (or (and .cse6 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse7 (mod .cse8 256))) (and (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse7) (<= (mod (+ .cse8 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= .cse7 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse9 256)) (= .cse9 0) (<= (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~a#1|) 256) .cse11) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (not (= .cse10 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0) (<= (mod .cse10 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod (+ .cse12 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse12 256)) (= .cse12 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse14 (mod .cse13 256))) (and (not (<= (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse14) (<= .cse14 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse15 (mod .cse16 256))) (and (= .cse11 .cse15) (not (<= .cse15 127)) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= (mod (+ .cse16 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127))))) .cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod .cse18 256) 127)) (= (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~a#1|) 256) .cse11) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= (mod (+ .cse19 .cse20) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse19 256)) (= .cse19 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse21 (mod .cse22 256))) (and (= .cse11 .cse21) (not (<= .cse21 127)) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= (mod (+ .cse22 .cse20) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse23 256)) (= .cse23 0) (not (<= (mod (+ .cse23 .cse20) 256) 127))))) .cse24 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= (mod (+ .cse25 .cse20) 256) .cse11) (not (= .cse25 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0) (<= (mod .cse25 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod .cse26 256) 127)) (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= (mod (+ .cse26 .cse20) 256) .cse11) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse27 (mod .cse28 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse27) (not (<= (mod (+ .cse28 .cse20) 256) 127)) (<= .cse27 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse30 (mod .cse29 256))) (and (<= .cse4 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= (mod (+ .cse29 .cse20) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse30) (<= .cse30 127)))))) .cse31))) (and (not (= .cse4 0)) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse32 256)) (= .cse32 0) (not (<= (mod (+ .cse32 .cse20) 256) 127)) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ .cse33 .cse20) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse33 256)) (= .cse33 0) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse34 (mod .cse35 256))) (and (= .cse11 .cse34) (not (<= .cse34 127)) (not (<= (mod (+ .cse35 .cse20) 256) 127)) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse37 (mod .cse36 256))) (and (<= (mod (+ .cse36 .cse20) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse37) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse37 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse38 (mod .cse39 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse38) (not (<= (mod (+ .cse39 .cse20) 256) 127)) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse38 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse40 (mod .cse41 256))) (and (= .cse11 .cse40) (not (<= .cse40 127)) (<= (mod (+ .cse41 .cse20) 256) 127) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) .cse31) (and .cse6 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse42 (mod .cse43 256))) (and (= .cse11 .cse42) (not (<= .cse42 127)) (<= (mod (+ .cse43 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse44 256)) (= .cse44 0) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse45 (mod .cse46 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse45) (<= (mod (+ .cse46 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse45 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse48 (mod .cse47 256))) (and (not (<= (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse48) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse48 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse50 (mod .cse49 256))) (and (not (<= (mod (+ .cse49 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= .cse11 .cse50) (not (<= .cse50 127)) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse51 256)) (= .cse51 0) (<= (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4) 256)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse4))) (and (= .cse3 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse52) 256)) (not (= .cse52 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) .cse5)))) .cse53) (and (or (and .cse6 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse54 (mod .cse55 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse54) (<= (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse54 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse57 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse56 (mod .cse57 256))) (and (= .cse11 .cse56) (not (<= .cse56 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (<= (mod (+ .cse57 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse58 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse59 (mod .cse58 256))) (and (not (<= (mod (+ .cse58 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse59) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse59 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse60 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod (+ .cse60 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse60 256)) (= .cse60 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|)))) .cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse61 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse61 256)) (= .cse61 0) (<= (mod (+ .cse61 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) (and .cse31 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse62 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ .cse62 .cse20) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse62 256)) (= .cse62 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse64 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse63 (mod .cse64 256))) (and (= .cse11 .cse63) (not (<= .cse63 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (<= (mod (+ .cse64 .cse20) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse65 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse66 (mod .cse65 256))) (and (<= (mod (+ .cse65 .cse20) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse66) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse66 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse68 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse67 (mod .cse68 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse67) (not (<= (mod (+ .cse68 .cse20) 256) 127)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse67 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse69 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse69 256)) (= .cse69 0) (not (<= (mod (+ .cse69 .cse20) 256) 127)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|)))) .cse24))) (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (not .cse53) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse70 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= .cse3 (mod (+ .cse70 .cse2) 256)) (not (= .cse70 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))))))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-23 14:27:08,413 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (let ((.cse10 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (let ((.cse6 (mod .cse10 256))) (let ((.cse24 (<= .cse6 127)) (.cse13 (< |c_ULTIMATE.start_main1_~y~0#1| 0)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse16 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse33 (not .cse0)) (.cse19 (not (= .cse6 0))) (.cse28 (not (= |c_ULTIMATE.start_main1_~y~0#1| 0))) (.cse32 (not .cse13)) (.cse3 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse7 (+ .cse6 (- 256))) (.cse14 (not .cse24))) (or (and .cse0 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse2 (mod .cse4 256))) (let ((.cse1 (mod .cse2 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse1 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse1 256)) (not (= .cse2 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse2))) (and (= .cse3 (mod (+ (* .cse4 255) .cse5) 256)) (not (= .cse5 0)) (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse11 (+ (mod (+ .cse9 .cse10) 256) (- 256)))) (let ((.cse12 (mod .cse11 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse11))) (and (not (= .cse8 0)) (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= .cse3 (mod (+ .cse9 .cse10 .cse8) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (= (mod .cse12 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse9 0)) (= .cse12 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))))) .cse13 .cse14) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse18 (+ (mod (+ .cse17 .cse10) 256) (- 256)))) (let ((.cse15 (mod .cse18 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~a#1|) 256) .cse16) (not (= .cse17 0)) (not (= .cse15 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= .cse3 (mod (+ .cse17 .cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse18)) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0))) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse13 .cse14) (and (let ((.cse22 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (and .cse13 (or (and .cse19 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse20 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse23) 256)))) (let ((.cse21 (mod .cse20 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse20) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= (mod (+ .cse21 .cse22) 256) .cse16) (not (= .cse21 0)) (not (= .cse23 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse24) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse27 (+ (mod (+ .cse26 .cse10) 256) (- 256)))) (let ((.cse25 (mod .cse27 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse16 (mod (+ .cse25 .cse22) 256)) (not (= .cse26 0)) (not (= .cse25 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse27) 256) |c_ULTIMATE.start_gcd_test_~a#1|))) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse14))) (and .cse28 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse31 (+ (- 256) (mod (+ .cse30 .cse10) 256)))) (let ((.cse29 (mod .cse31 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse16 (mod (+ .cse22 .cse29) 256)) (not (= .cse29 0)) (not (= .cse30 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse31) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse32))) .cse33) (and (or (and .cse28 .cse32 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse34) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse34 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse34 0)))))) (and (or (and .cse14 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse35 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse35) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse35 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse35 0)))))) (and .cse19 .cse24 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6) 256))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse36) 256)) (= (mod (mod .cse36 |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse36 0)) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) .cse13)) .cse33) (and .cse33 (or (and .cse13 (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse39 (+ (mod (+ .cse38 .cse10) 256) (- 256)))) (let ((.cse37 (mod .cse39 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod .cse37 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse38 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse39) 256) |c_ULTIMATE.start_gcd_test_~a#1|))) (= .cse37 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse41 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7) 256))) (let ((.cse40 (mod .cse41 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse40 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse41) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse40 256)) (not (= .cse41 0))))))) .cse14) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse42 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse44) 256)))) (let ((.cse43 (mod .cse42 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse42) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= .cse43 0) (not (= .cse44 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse43 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse45 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6) 256))) (let ((.cse46 (mod .cse45 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse45) 256)) (= (mod .cse46 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse45 0)) (= .cse46 0) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) .cse19 .cse24))) (and .cse28 .cse32 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse47 (+ (- 256) (mod (+ .cse49 .cse10) 256)))) (let ((.cse48 (mod .cse47 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse47) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (= .cse48 0) (not (= .cse49 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse48 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse50 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse51 (mod .cse50 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse50) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse51 256)) (= .cse51 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse50 0)))))))))) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse52 (mod .cse53 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse52 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse52 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse54 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse52))) (and (= .cse3 (mod (+ (* .cse53 255) .cse54) 256)) (not (= .cse54 0)) (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))))))) .cse13 .cse14)))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-23 14:27:13,633 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse3 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (let ((.cse1 (mod .cse3 256))) (let ((.cse10 (< |c_ULTIMATE.start_main1_~y~0#1| 0)) (.cse19 (<= .cse1 127)) (.cse12 (< |c_ULTIMATE.start_main1_~g~0#1| 0))) (let ((.cse4 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse26 (not .cse12)) (.cse18 (not (= .cse1 0))) (.cse6 (+ .cse1 (- 256))) (.cse11 (not .cse19)) (.cse13 (not (= |c_ULTIMATE.start_main1_~y~0#1| 0))) (.cse14 (not .cse10)) (.cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (= (mod (mod .cse32 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse32) 256) |c_ULTIMATE.start_main1_~g~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse32 0))))))) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse5 (+ (mod (+ .cse2 .cse3) 256) (- 256)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse5))) (and (not (= .cse0 0)) (<= .cse1 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= (mod (+ .cse2 .cse3 .cse0) 256) .cse4) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (= (mod .cse5 |c_ULTIMATE.start_main1_~g~0#1|) 0) (not (= .cse2 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse9 (mod .cse7 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse9))) (and (= .cse4 (mod (+ (* .cse7 255) .cse8) 256)) (not (= .cse8 0)) (<= .cse1 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (= (mod .cse9 |c_ULTIMATE.start_main1_~g~0#1|) 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse9 0))))))) .cse10 .cse11 .cse12) (and (or (and .cse13 .cse14 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse15 (+ (- 256) (mod (+ .cse16 .cse3) 256)))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse15) 256) |c_ULTIMATE.start_main1_~g~0#1|) (not (= .cse16 0)) (= (mod (mod .cse15 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) .cse17)) (and (or (and .cse18 .cse19 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse20 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse1) 256))) (and (= (mod .cse20 |c_ULTIMATE.start_main1_~g~0#1|) 0) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse20) 256) |c_ULTIMATE.start_main1_~g~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse20 0)) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse1))) (let ((.cse21 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse22) 256)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse21) 256) |c_ULTIMATE.start_main1_~g~0#1|) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (not (= .cse22 0)) (= (mod .cse21 |c_ULTIMATE.start_main1_~g~0#1|) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6) 256))) (and (= (mod .cse23 |c_ULTIMATE.start_main1_~g~0#1|) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse23) 256) |c_ULTIMATE.start_main1_~g~0#1|))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse23 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse25 (+ (mod (+ .cse24 .cse3) 256) (- 256)))) (and (not (= .cse24 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse25) 256) |c_ULTIMATE.start_main1_~g~0#1|))) (= (mod (mod .cse25 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse11)) .cse10)) .cse26) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse29 (mod .cse27 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse29))) (and (= .cse4 (mod (+ (* .cse27 255) .cse28) 256)) (not (= .cse28 0)) (<= .cse1 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse29 0)) (= (mod (mod .cse29 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0))))) .cse10 .cse11 .cse12) (and .cse26 (or (and .cse10 (or (and .cse18 .cse19 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse30 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse1) 256))) (and (= (mod (mod .cse30 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse30) 256) |c_ULTIMATE.start_main1_~g~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse30 0)) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse31 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse31) 256) |c_ULTIMATE.start_main1_~g~0#1|))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse31 0)) (= (mod (mod .cse31 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0)))) .cse11))) (and .cse13 .cse14 .cse17)))))))) (not (= |c_ULTIMATE.start_main1_~g~0#1| 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| 127)) is different from false [2022-11-23 14:27:14,984 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-23 14:27:14,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:30:14,653 WARN L233 SmtUtils]: Spent 2.59m on a formula simplification. DAG size of input: 80 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:34:05,661 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse23 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (let ((.cse0 (not .cse23)) (.cse4 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse3 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse2 (mod (+ .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse1 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse2) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse1 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse2 127)) (<= (mod (+ .cse3 .cse4) 256) 127) (<= (mod .cse3 256) 127) (= 0 .cse2) (not (= (mod (mod .cse2 .cse1) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse7 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (mod .cse7 256))) (let ((.cse5 (+ (- 256) .cse8))) (let ((.cse6 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse5) 256))) (or (not (= (mod (mod .cse5 .cse6) 256) 0)) (not (<= (mod (+ .cse7 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse7 .cse4) 256) 127) (<= .cse8 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse6 |c_ULTIMATE.start_main1_~y~0#1|))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse9 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod .cse9 256))) (let ((.cse10 (+ (- 256) .cse12))) (let ((.cse11 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse10) 256))) (or (not (<= (mod (+ .cse9 .cse4) 256) 127)) (not (= (mod (mod .cse10 .cse11) 256) 0)) (<= .cse12 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse11 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse15 (+ (- 256) .cse16))) (let ((.cse14 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse15) 256))) (or (not (<= (mod (+ .cse13 .cse4) 256) 127)) (<= .cse14 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse15 .cse14) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse13 256) 127) (<= .cse16 127)))))))))) .cse0) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse17 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (mod .cse17 256))) (let ((.cse19 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse18) 256))) (or (not (<= (mod (+ .cse17 .cse4) 256) 127)) (= .cse18 0) (not (<= (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse19 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse18 127)) (not (= (mod (mod .cse18 .cse19) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse20 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse21 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse22) 256))) (or (not (<= (mod (+ .cse20 .cse4) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse21 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse22 127)) (= 0 .cse22) (not (<= (mod .cse20 256) 127)) (not (= (mod (mod .cse22 .cse21) 256) 0))))))))))) (or .cse23 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse26 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod (+ .cse26 .cse4) 256))) (let ((.cse24 (+ (- 256) .cse27))) (let ((.cse25 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse24) 256))) (or (not (= (mod (mod .cse24 .cse25) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse27 127) (<= .cse25 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse26 256) 127)) (= .cse26 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod .cse29 256))) (let ((.cse30 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse28) 256))) (or (= .cse28 0) (not (<= (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse29 .cse4) 256) 127) (<= .cse30 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse28 127)) (not (= (mod (mod .cse28 .cse30) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse32 (mod .cse31 256))) (let ((.cse33 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse32) 256))) (or (not (<= (mod (+ .cse31 .cse4) 256) 127)) (= .cse32 0) (<= .cse33 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse32 127)) (not (= (mod (mod .cse32 .cse33) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse34 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse37 (mod (+ .cse34 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse36 (+ (- 256) .cse37))) (let ((.cse35 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse36) 256))) (or (not (<= (mod (+ .cse34 .cse4) 256) 127)) (<= .cse35 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse36 .cse35) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod .cse34 256) 127)) (<= .cse37 127) (= .cse34 0)))))))))) .cse0) (or .cse23 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse40 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse41 (mod .cse40 256))) (let ((.cse38 (+ (- 256) .cse41))) (let ((.cse39 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse38) 256))) (or (not (= (mod (mod .cse38 .cse39) 256) 0)) (not (<= (mod (+ .cse40 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse40 .cse4) 256) 127) (<= .cse41 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse39 |c_ULTIMATE.start_main1_~y~0#1|))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse44 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse45 (mod (+ .cse44 .cse4) 256))) (let ((.cse42 (+ (- 256) .cse45))) (let ((.cse43 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse42) 256))) (or (not (= (mod (mod .cse42 .cse43) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse45 127) (<= (mod .cse44 256) 127) (<= .cse43 |c_ULTIMATE.start_main1_~y~0#1|))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse23 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod (+ .cse47 .cse4) 256))) (let ((.cse48 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse46) 256))) (or (not (<= .cse46 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse46 0) (<= (mod .cse47 256) 127) (<= (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= .cse48 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse46 .cse48) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse49 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse52 (mod .cse49 256))) (let ((.cse50 (+ (- 256) .cse52))) (let ((.cse51 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse50) 256))) (or (not (<= (mod (+ .cse49 .cse4) 256) 127)) (not (= (mod (mod .cse50 .cse51) 256) 0)) (<= .cse52 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse51 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse49 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))))) (or .cse23 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse56 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse55 (mod (+ .cse56 .cse4) 256))) (let ((.cse53 (+ (- 256) .cse55))) (let ((.cse54 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse53) 256))) (or (not (= (mod (mod .cse53 .cse54) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse55 127) (<= (mod .cse56 256) 127) (<= .cse54 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse56 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse59 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse60 (mod .cse59 256))) (let ((.cse57 (+ (- 256) .cse60))) (let ((.cse58 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse57) 256))) (or (not (= (mod (mod .cse57 .cse58) 256) 0)) (<= (mod (+ .cse59 .cse4) 256) 127) (<= .cse60 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse58 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse59 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse61 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse64 (mod .cse61 256))) (let ((.cse62 (+ (- 256) .cse64))) (let ((.cse63 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse62) 256))) (or (not (<= (mod (+ .cse61 .cse4) 256) 127)) (not (= (mod (mod .cse62 .cse63) 256) 0)) (not (<= (mod (+ .cse61 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse64 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse63 |c_ULTIMATE.start_main1_~y~0#1|))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse66 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse65 (mod (+ .cse66 .cse4) 256))) (let ((.cse67 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse65) 256))) (or (not (<= .cse65 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse66 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse65 0) (<= (mod .cse66 256) 127) (<= .cse67 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse65 .cse67) 256) 0)))))))))) .cse23) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse70 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse71 (mod (+ .cse70 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse69 (+ (- 256) .cse71))) (let ((.cse68 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse69) 256))) (or (<= .cse68 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse69 .cse68) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse70 .cse4) 256) 127) (<= (mod .cse70 256) 127) (<= .cse71 127))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse74 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse75 (mod .cse74 256))) (let ((.cse72 (+ (- 256) .cse75))) (let ((.cse73 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse72) 256))) (or (not (= (mod (mod .cse72 .cse73) 256) 0)) (<= (mod (+ .cse74 .cse4) 256) 127) (<= .cse75 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse73 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse74 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse77 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse76 (mod (+ .cse77 .cse4) 256))) (let ((.cse78 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse76) 256))) (or (not (<= .cse76 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse76 0) (not (<= (mod .cse77 256) 127)) (<= (mod (+ .cse77 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= .cse78 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse76 .cse78) 256) 0)) (= .cse77 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse79 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse80 (mod .cse79 256))) (let ((.cse81 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse80) 256))) (or (not (<= (mod (+ .cse79 .cse4) 256) 127)) (= .cse80 0) (<= .cse81 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse80 127)) (not (= (mod (mod .cse80 .cse81) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse79 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse23) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse82 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse84 (mod (+ .cse82 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse83 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse84) 256))) (or (not (<= (mod (+ .cse82 .cse4) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse83 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse84 127)) (<= (mod .cse82 256) 127) (= 0 .cse84) (not (= (mod (mod .cse84 .cse83) 256) 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse85 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse88 (mod .cse85 256))) (let ((.cse86 (+ (- 256) .cse88))) (let ((.cse87 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse86) 256))) (or (not (<= (mod (+ .cse85 .cse4) 256) 127)) (not (= (mod (mod .cse86 .cse87) 256) 0)) (not (<= (mod (+ .cse85 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse88 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse87 |c_ULTIMATE.start_main1_~y~0#1|))))))))))) (or .cse23 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse90 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse89 (mod (+ .cse90 .cse4) 256))) (let ((.cse91 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse89) 256))) (or (not (<= .cse89 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse90 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse89 0) (not (<= (mod .cse90 256) 127)) (<= .cse91 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse89 .cse91) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse92 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse93 (mod .cse92 256))) (let ((.cse94 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse93) 256))) (or (not (<= (mod (+ .cse92 .cse4) 256) 127)) (= .cse93 0) (not (<= (mod (+ .cse92 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse94 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse93 127)) (not (= (mod (mod .cse93 .cse94) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse97 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse96 (mod (+ .cse97 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse95 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse96) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse95 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse96 127)) (<= (mod (+ .cse97 .cse4) 256) 127) (= 0 .cse96) (not (<= (mod .cse97 256) 127)) (not (= (mod (mod .cse96 .cse95) 256) 0)) (= .cse97 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse99 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse98 (mod .cse99 256))) (let ((.cse100 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse98) 256))) (or (= .cse98 0) (not (<= (mod (+ .cse99 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse99 .cse4) 256) 127) (<= .cse100 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse98 127)) (not (= (mod (mod .cse98 .cse100) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse104 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse103 (mod (+ .cse104 .cse4) 256))) (let ((.cse101 (+ (- 256) .cse103))) (let ((.cse102 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse101) 256))) (or (not (= (mod (mod .cse101 .cse102) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse103 127) (<= .cse102 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse104 256) 127)) (<= (mod (+ .cse104 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse104 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse106 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse105 (mod .cse106 256))) (let ((.cse107 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse105) 256))) (or (= .cse105 0) (<= (mod (+ .cse106 .cse4) 256) 127) (<= .cse107 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse105 127)) (not (= (mod (mod .cse105 .cse107) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse106 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))) .cse23) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse110 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse111 (mod (+ .cse110 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse109 (+ (- 256) .cse111))) (let ((.cse108 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse109) 256))) (or (<= .cse108 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse109 .cse108) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse110 .cse4) 256) 127) (not (<= (mod .cse110 256) 127)) (<= .cse111 127) (= .cse110 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse113 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse112 (mod .cse113 256))) (let ((.cse114 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse112) 256))) (or (= .cse112 0) (<= (mod (+ .cse113 .cse4) 256) 127) (<= .cse114 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse112 127)) (not (= (mod (mod .cse112 .cse114) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse113 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) is different from true [2022-11-23 14:34:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-23 14:34:06,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:34:06,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856276666] [2022-11-23 14:34:06,610 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:34:06,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139721393] [2022-11-23 14:34:06,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139721393] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:34:06,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1405119401] [2022-11-23 14:34:06,612 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-23 14:34:06,612 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:34:06,612 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:34:06,613 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:34:06,613 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:34:06,743 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:34:10,015 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '306#(and (= |ULTIMATE.start_gcd_test_~b#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~b#1| 128)) (<= |ULTIMATE.start_gcd_test_#in~a#1| 127) (<= |ULTIMATE.start_main1_~x~0#1| 127) (<= |ULTIMATE.start_gcd_test_#in~b#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (< 0 |ULTIMATE.start_main1_~y~0#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (ite (<= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~y~0#1|) 1 0) |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= 0 (+ |ULTIMATE.start_main1_~x~0#1| 128)) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_#res#1|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-23 14:34:10,015 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:34:10,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:34:10,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-23 14:34:10,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545958503] [2022-11-23 14:34:10,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:34:10,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 14:34:10,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:34:10,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 14:34:10,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=167, Unknown=5, NotChecked=116, Total=342 [2022-11-23 14:34:10,018 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:34:11,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-23 14:34:13,634 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-23 14:34:15,718 WARN L859 $PredicateComparison]: unable to prove that (and (let ((.cse0 (< |c_ULTIMATE.start_main1_~y~0#1| 0))) (or (and .cse0 (let ((.cse1 (mod (* |c_ULTIMATE.start_main1_~y~0#1| 255) 256))) (let ((.cse2 (<= .cse1 127))) (or (and (= .cse1 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (not .cse2)) (and (= .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) .cse2))))) (and (not .cse0) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|)))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (let ((.cse26 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (let ((.cse3 (not .cse26)) (.cse7 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or .cse3 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse6 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse5 (mod (+ .cse6 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse4 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse5) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse5 127)) (<= (mod (+ .cse6 .cse7) 256) 127) (<= (mod .cse6 256) 127) (= 0 .cse5) (not (= (mod (mod .cse5 .cse4) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse10 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse11 (mod .cse10 256))) (let ((.cse8 (+ (- 256) .cse11))) (let ((.cse9 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse8) 256))) (or (not (= (mod (mod .cse8 .cse9) 256) 0)) (not (<= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse10 .cse7) 256) 127) (<= .cse11 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse9 |c_ULTIMATE.start_main1_~y~0#1|))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse12 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse15 (mod .cse12 256))) (let ((.cse13 (+ (- 256) .cse15))) (let ((.cse14 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse13) 256))) (or (not (<= (mod (+ .cse12 .cse7) 256) 127)) (not (= (mod (mod .cse13 .cse14) 256) 0)) (<= .cse15 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse14 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse12 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse16 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse19 (mod (+ .cse16 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse18 (+ (- 256) .cse19))) (let ((.cse17 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse18) 256))) (or (not (<= (mod (+ .cse16 .cse7) 256) 127)) (<= .cse17 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse18 .cse17) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse16 256) 127) (<= .cse19 127)))))))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse20 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse21 (mod .cse20 256))) (let ((.cse22 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse21) 256))) (or (not (<= (mod (+ .cse20 .cse7) 256) 127)) (= .cse21 0) (not (<= (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse22 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse21 127)) (not (= (mod (mod .cse21 .cse22) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse23 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse24 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse25) 256))) (or (not (<= (mod (+ .cse23 .cse7) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse24 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse25 127)) (= 0 .cse25) (not (<= (mod .cse23 256) 127)) (not (= (mod (mod .cse25 .cse24) 256) 0))))))))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod (+ .cse29 .cse7) 256))) (let ((.cse27 (+ (- 256) .cse30))) (let ((.cse28 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse27) 256))) (or (not (= (mod (mod .cse27 .cse28) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse30 127) (<= .cse28 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse29 256) 127)) (= .cse29 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse32 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod .cse32 256))) (let ((.cse33 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse31) 256))) (or (= .cse31 0) (not (<= (mod (+ .cse32 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse32 .cse7) 256) 127) (<= .cse33 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse31 127)) (not (= (mod (mod .cse31 .cse33) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse34 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse35 (mod .cse34 256))) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse35) 256))) (or (not (<= (mod (+ .cse34 .cse7) 256) 127)) (= .cse35 0) (<= .cse36 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse35 127)) (not (= (mod (mod .cse35 .cse36) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse34 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse37 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse40 (mod (+ .cse37 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse39 (+ (- 256) .cse40))) (let ((.cse38 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse39) 256))) (or (not (<= (mod (+ .cse37 .cse7) 256) 127)) (<= .cse38 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse39 .cse38) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod .cse37 256) 127)) (<= .cse40 127) (= .cse37 0)))))))))) .cse3) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse43 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse44 (mod .cse43 256))) (let ((.cse41 (+ (- 256) .cse44))) (let ((.cse42 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse41) 256))) (or (not (= (mod (mod .cse41 .cse42) 256) 0)) (not (<= (mod (+ .cse43 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse43 .cse7) 256) 127) (<= .cse44 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse42 |c_ULTIMATE.start_main1_~y~0#1|))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse48 (mod (+ .cse47 .cse7) 256))) (let ((.cse45 (+ (- 256) .cse48))) (let ((.cse46 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse45) 256))) (or (not (= (mod (mod .cse45 .cse46) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse48 127) (<= (mod .cse47 256) 127) (<= .cse46 |c_ULTIMATE.start_main1_~y~0#1|))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse50 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse49 (mod (+ .cse50 .cse7) 256))) (let ((.cse51 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse49) 256))) (or (not (<= .cse49 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse49 0) (<= (mod .cse50 256) 127) (<= (mod (+ .cse50 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= .cse51 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse49 .cse51) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse52 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse55 (mod .cse52 256))) (let ((.cse53 (+ (- 256) .cse55))) (let ((.cse54 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse53) 256))) (or (not (<= (mod (+ .cse52 .cse7) 256) 127)) (not (= (mod (mod .cse53 .cse54) 256) 0)) (<= .cse55 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse54 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse52 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse59 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse58 (mod (+ .cse59 .cse7) 256))) (let ((.cse56 (+ (- 256) .cse58))) (let ((.cse57 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse56) 256))) (or (not (= (mod (mod .cse56 .cse57) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse58 127) (<= (mod .cse59 256) 127) (<= .cse57 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse59 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse62 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse63 (mod .cse62 256))) (let ((.cse60 (+ (- 256) .cse63))) (let ((.cse61 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse60) 256))) (or (not (= (mod (mod .cse60 .cse61) 256) 0)) (<= (mod (+ .cse62 .cse7) 256) 127) (<= .cse63 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse61 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse64 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse67 (mod .cse64 256))) (let ((.cse65 (+ (- 256) .cse67))) (let ((.cse66 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse65) 256))) (or (not (<= (mod (+ .cse64 .cse7) 256) 127)) (not (= (mod (mod .cse65 .cse66) 256) 0)) (not (<= (mod (+ .cse64 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse67 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse66 |c_ULTIMATE.start_main1_~y~0#1|))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse69 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse68 (mod (+ .cse69 .cse7) 256))) (let ((.cse70 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse68) 256))) (or (not (<= .cse68 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse69 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse68 0) (<= (mod .cse69 256) 127) (<= .cse70 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse68 .cse70) 256) 0)))))))))) .cse26) (or .cse3 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse73 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse74 (mod (+ .cse73 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse72 (+ (- 256) .cse74))) (let ((.cse71 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse72) 256))) (or (<= .cse71 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse72 .cse71) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse73 .cse7) 256) 127) (<= (mod .cse73 256) 127) (<= .cse74 127))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse77 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse78 (mod .cse77 256))) (let ((.cse75 (+ (- 256) .cse78))) (let ((.cse76 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse75) 256))) (or (not (= (mod (mod .cse75 .cse76) 256) 0)) (<= (mod (+ .cse77 .cse7) 256) 127) (<= .cse78 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse76 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod (+ .cse77 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse80 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse79 (mod (+ .cse80 .cse7) 256))) (let ((.cse81 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse79) 256))) (or (not (<= .cse79 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse79 0) (not (<= (mod .cse80 256) 127)) (<= (mod (+ .cse80 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (<= .cse81 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse79 .cse81) 256) 0)) (= .cse80 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse82 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse83 (mod .cse82 256))) (let ((.cse84 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse83) 256))) (or (not (<= (mod (+ .cse82 .cse7) 256) 127)) (= .cse83 0) (<= .cse84 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse83 127)) (not (= (mod (mod .cse83 .cse84) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse82 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse26) (or .cse3 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse85 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse87 (mod (+ .cse85 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse86 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse87) 256))) (or (not (<= (mod (+ .cse85 .cse7) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse86 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse87 127)) (<= (mod .cse85 256) 127) (= 0 .cse87) (not (= (mod (mod .cse87 .cse86) 256) 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse88 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse91 (mod .cse88 256))) (let ((.cse89 (+ (- 256) .cse91))) (let ((.cse90 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse89) 256))) (or (not (<= (mod (+ .cse88 .cse7) 256) 127)) (not (= (mod (mod .cse89 .cse90) 256) 0)) (not (<= (mod (+ .cse88 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse91 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= .cse90 |c_ULTIMATE.start_main1_~y~0#1|))))))))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse93 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse92 (mod (+ .cse93 .cse7) 256))) (let ((.cse94 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse92) 256))) (or (not (<= .cse92 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse93 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse92 0) (not (<= (mod .cse93 256) 127)) (<= .cse94 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse92 .cse94) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse95 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse96 (mod .cse95 256))) (let ((.cse97 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse96) 256))) (or (not (<= (mod (+ .cse95 .cse7) 256) 127)) (= .cse96 0) (not (<= (mod (+ .cse95 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse97 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse96 127)) (not (= (mod (mod .cse96 .cse97) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse3 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse100 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse99 (mod (+ .cse100 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse98 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse99) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse98 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse99 127)) (<= (mod (+ .cse100 .cse7) 256) 127) (= 0 .cse99) (not (<= (mod .cse100 256) 127)) (not (= (mod (mod .cse99 .cse98) 256) 0)) (= .cse100 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse102 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse101 (mod .cse102 256))) (let ((.cse103 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse101) 256))) (or (= .cse101 0) (not (<= (mod (+ .cse102 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse102 .cse7) 256) 127) (<= .cse103 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse101 127)) (not (= (mod (mod .cse101 .cse103) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse107 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse106 (mod (+ .cse107 .cse7) 256))) (let ((.cse104 (+ (- 256) .cse106))) (let ((.cse105 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse104) 256))) (or (not (= (mod (mod .cse104 .cse105) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse106 127) (<= .cse105 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse107 256) 127)) (<= (mod (+ .cse107 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse107 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse109 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse108 (mod .cse109 256))) (let ((.cse110 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse108) 256))) (or (= .cse108 0) (<= (mod (+ .cse109 .cse7) 256) 127) (<= .cse110 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse108 127)) (not (= (mod (mod .cse108 .cse110) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse109 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))) .cse26) (or .cse3 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse113 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse114 (mod (+ .cse113 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse112 (+ (- 256) .cse114))) (let ((.cse111 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse112) 256))) (or (<= .cse111 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod .cse112 .cse111) 256) 0)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse113 .cse7) 256) 127) (not (<= (mod .cse113 256) 127)) (<= .cse114 127) (= .cse113 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse116 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse115 (mod .cse116 256))) (let ((.cse117 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse115) 256))) (or (= .cse115 0) (<= (mod (+ .cse116 .cse7) 256) 127) (<= .cse117 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= .cse115 127)) (not (= (mod (mod .cse115 .cse117) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse116 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)))) is different from true [2022-11-23 14:34:21,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-23 14:34:24,051 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse87 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse8 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse33 (not .cse8)) (.cse77 (mod .cse87 256)) (.cse0 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse1 (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)))) (and (or (not .cse0) (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~y~0#1|) .cse1) (let ((.cse22 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse13 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256))) (let ((.cse19 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse75 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse76 (mod .cse75 256))) (and (not (<= (mod (+ .cse75 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= .cse13 .cse76) (not (<= .cse76 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0))))))) (.cse26 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse74 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse73 (mod .cse74 256))) (and (= .cse13 .cse73) (not (<= .cse73 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (not (<= (mod (+ .cse74 .cse22) 256) 127))))))) (.cse55 (< |c_ULTIMATE.start_main1_~y~0#1| 0)) (.cse5 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse4 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (and (let ((.cse6 (mod .cse4 256))) (let ((.cse7 (<= .cse6 127))) (or (and (let ((.cse2 (+ .cse6 (- 256)))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse2) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse2))) (and (not (= .cse3 0)) (= (mod (+ .cse3 .cse4) 256) .cse5) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (not .cse7) (or (and .cse8 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse9 (mod .cse10 256))) (and (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse9) (<= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= .cse9 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse11 256)) (= .cse11 0) (<= (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse12 |c_ULTIMATE.start_gcd_test_~a#1|) 256) .cse13) (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (not (= .cse12 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0) (<= (mod .cse12 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse14 256)) (= .cse14 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse16 (mod .cse15 256))) (and (not (<= (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse16) (<= .cse16 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse17 (mod .cse18 256))) (and (= .cse13 .cse17) (not (<= .cse17 127)) (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127))))) .cse19 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod .cse20 256) 127)) (= (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~a#1|) 256) .cse13) (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= (mod (+ .cse21 .cse22) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse21 256)) (= .cse21 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse23 (mod .cse24 256))) (and (= .cse13 .cse23) (not (<= .cse23 127)) (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= (mod (+ .cse24 .cse22) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse25 256)) (= .cse25 0) (not (<= (mod (+ .cse25 .cse22) 256) 127))))) .cse26 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= (mod (+ .cse27 .cse22) 256) .cse13) (not (= .cse27 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0) (<= (mod .cse27 256) 127)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod .cse28 256) 127)) (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= (mod (+ .cse28 .cse22) 256) .cse13) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse29 (mod .cse30 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse29) (not (<= (mod (+ .cse30 .cse22) 256) 127)) (<= .cse29 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse32 (mod .cse31 256))) (and (<= .cse6 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (<= (mod (+ .cse31 .cse22) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse32) (<= .cse32 127)))))) .cse33))) (and (not (= .cse6 0)) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse34 256)) (= .cse34 0) (not (<= (mod (+ .cse34 .cse22) 256) 127)) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ .cse35 .cse22) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse35 256)) (= .cse35 0) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse36 (mod .cse37 256))) (and (= .cse13 .cse36) (not (<= .cse36 127)) (not (<= (mod (+ .cse37 .cse22) 256) 127)) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse39 (mod .cse38 256))) (and (<= (mod (+ .cse38 .cse22) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse39) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse39 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse40 (mod .cse41 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse40) (not (<= (mod (+ .cse41 .cse22) 256) 127)) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse40 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse42 (mod .cse43 256))) (and (= .cse13 .cse42) (not (<= .cse42 127)) (<= (mod (+ .cse43 .cse22) 256) 127) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) .cse33) (and .cse8 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse44 (mod .cse45 256))) (and (= .cse13 .cse44) (not (<= .cse44 127)) (<= (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod (+ .cse46 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse46 256)) (= .cse46 0) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse47 (mod .cse48 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse47) (<= (mod (+ .cse48 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse47 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse50 (mod .cse49 256))) (and (not (<= (mod (+ .cse49 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse50) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse50 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse52 (mod .cse51 256))) (and (not (<= (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= .cse13 .cse52) (not (<= .cse52 127)) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse53 256)) (= .cse53 0) (<= (mod (+ .cse53 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6) 256)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse54 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (and (= .cse5 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse54) 256)) (not (= .cse54 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) .cse7)))) .cse55) (and (or (and .cse8 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse57 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse56 (mod .cse57 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse56) (<= (mod (+ .cse57 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse56 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse59 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse58 (mod .cse59 256))) (and (= .cse13 .cse58) (not (<= .cse58 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (<= (mod (+ .cse59 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse60 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse61 (mod .cse60 256))) (and (not (<= (mod (+ .cse60 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse61) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse61 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse62 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse62 256)) (= .cse62 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|)))) .cse19 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse63 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse63 256)) (= .cse63 0) (<= (mod (+ .cse63 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) (and .cse33 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse64 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ .cse64 .cse22) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse64 256)) (= .cse64 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse65 (mod .cse66 256))) (and (= .cse13 .cse65) (not (<= .cse65 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (<= (mod (+ .cse66 .cse22) 256) 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse67 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse68 (mod .cse67 256))) (and (<= (mod (+ .cse67 .cse22) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| .cse68) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse68 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse70 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse69 (mod .cse70 256))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse69) (not (<= (mod (+ .cse70 .cse22) 256) 127)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= .cse69 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse71 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse71 256)) (= .cse71 0) (not (<= (mod (+ .cse71 .cse22) 256) 127)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|)))) .cse26))) (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (not .cse55) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse72 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (and (= .cse5 (mod (+ .cse72 .cse4) 256)) (not (= .cse72 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))))))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (<= |c_ULTIMATE.start_gcd_test_~b#1| |c_ULTIMATE.start_main1_~y~0#1|) (not (= .cse77 0)) (not (<= |c_ULTIMATE.start_gcd_test_~b#1| 127)) .cse1) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (or (let ((.cse85 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse89 (mod (+ .cse87 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse90 (mod (+ .cse87 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse83 (<= .cse90 |c_ULTIMATE.start_main1_~y~0#1|)) (.cse84 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse90) 256) 0))) (.cse86 (not (<= .cse90 127))) (.cse78 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse89) 256) 0))) (.cse79 (not .cse85)) (.cse81 (not (<= .cse89 127))) (.cse82 (<= .cse89 |c_ULTIMATE.start_main1_~y~0#1|)) (.cse88 (<= .cse77 127))) (and (or (let ((.cse80 (= .cse87 0))) (and (or .cse8 (<= .cse77 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse77) 256) 0))) (or .cse78 .cse79 .cse80 .cse81 .cse33 .cse82) (or .cse83 .cse80 .cse84 .cse85 .cse33 .cse86))) (not .cse88)) (or (and (or .cse83 .cse84 .cse85 .cse33 .cse86) (or .cse78 .cse79 .cse81 .cse33 .cse82)) .cse88)))) .cse0 .cse1)))) is different from false [2022-11-23 14:34:26,097 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)))) (and (or (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~y~0#1|) .cse0) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (<= |c_ULTIMATE.start_gcd_test_~b#1| |c_ULTIMATE.start_main1_~y~0#1|) (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)) .cse0) (let ((.cse11 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (let ((.cse7 (mod .cse11 256))) (let ((.cse25 (<= .cse7 127)) (.cse14 (< |c_ULTIMATE.start_main1_~y~0#1| 0)) (.cse1 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse17 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse34 (not .cse1)) (.cse20 (not (= .cse7 0))) (.cse29 (not (= |c_ULTIMATE.start_main1_~y~0#1| 0))) (.cse33 (not .cse14)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse8 (+ .cse7 (- 256))) (.cse15 (not .cse25))) (or (and .cse1 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse8))) (let ((.cse3 (mod .cse5 256))) (let ((.cse2 (mod .cse3 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse2 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse2 256)) (not (= .cse3 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse3))) (and (= .cse4 (mod (+ (* .cse5 255) .cse6) 256)) (not (= .cse6 0)) (<= .cse7 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse8))) (let ((.cse12 (+ (mod (+ .cse10 .cse11) 256) (- 256)))) (let ((.cse13 (mod .cse12 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse12))) (and (not (= .cse9 0)) (<= .cse7 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= .cse4 (mod (+ .cse10 .cse11 .cse9) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (= (mod .cse13 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse10 0)) (= .cse13 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))))) .cse14 .cse15) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse8))) (let ((.cse19 (+ (mod (+ .cse18 .cse11) 256) (- 256)))) (let ((.cse16 (mod .cse19 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse16 |c_ULTIMATE.start_gcd_test_~a#1|) 256) .cse17) (not (= .cse18 0)) (not (= .cse16 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (<= .cse7 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= .cse4 (mod (+ .cse18 .cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse19)) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0))) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse14 .cse15) (and (let ((.cse23 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (and .cse14 (or (and .cse20 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse21 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse24) 256)))) (let ((.cse22 (mod .cse21 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse21) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse7 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= (mod (+ .cse22 .cse23) 256) .cse17) (not (= .cse22 0)) (not (= .cse24 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse25) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse8))) (let ((.cse28 (+ (mod (+ .cse27 .cse11) 256) (- 256)))) (let ((.cse26 (mod .cse28 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse17 (mod (+ .cse26 .cse23) 256)) (not (= .cse27 0)) (not (= .cse26 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse28) 256) |c_ULTIMATE.start_gcd_test_~a#1|))) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse15))) (and .cse29 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse32 (+ (- 256) (mod (+ .cse31 .cse11) 256)))) (let ((.cse30 (mod .cse32 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse17 (mod (+ .cse23 .cse30) 256)) (not (= .cse30 0)) (not (= .cse31 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse32) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse33))) .cse34) (and (or (and .cse29 .cse33 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse35 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse35) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse35 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse35 0)))))) (and (or (and .cse15 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse8) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse36) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse36 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse36 0)))))) (and .cse20 .cse25 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse37 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7) 256))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse37) 256)) (= (mod (mod .cse37 |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse37 0)) (<= .cse7 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) .cse14)) .cse34) (and .cse34 (or (and .cse14 (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse8))) (let ((.cse40 (+ (mod (+ .cse39 .cse11) 256) (- 256)))) (let ((.cse38 (mod .cse40 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod .cse38 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse39 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse40) 256) |c_ULTIMATE.start_gcd_test_~a#1|))) (= .cse38 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse42 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse8) 256))) (let ((.cse41 (mod .cse42 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse41 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse42) 256)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse41 256)) (not (= .cse42 0))))))) .cse15) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7))) (let ((.cse43 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse45) 256)))) (let ((.cse44 (mod .cse43 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse43) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse7 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= .cse44 0) (not (= .cse45 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse44 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse46 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse7) 256))) (let ((.cse47 (mod .cse46 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse46) 256)) (= (mod .cse47 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse46 0)) (= .cse47 0) (<= .cse7 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) .cse20 .cse25))) (and .cse29 .cse33 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse48 (+ (- 256) (mod (+ .cse50 .cse11) 256)))) (let ((.cse49 (mod .cse48 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse48) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (= .cse49 0) (not (= .cse50 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse49 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse51 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse52 (mod .cse51 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse51) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse52 256)) (= .cse52 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse51 0)))))))))) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse54 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse8))) (let ((.cse53 (mod .cse54 256))) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse53 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse53 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse53))) (and (= .cse4 (mod (+ (* .cse54 255) .cse55) 256)) (not (= .cse55 0)) (<= .cse7 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))))))) .cse14 .cse15)))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)))) is different from false [2022-11-23 14:34:28,126 WARN L837 $PredicateComparison]: unable to prove that (and (or (<= |c_ULTIMATE.start_main1_~g~0#1| |c_ULTIMATE.start_main1_~y~0#1|) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse3 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (let ((.cse1 (mod .cse3 256))) (let ((.cse10 (< |c_ULTIMATE.start_main1_~y~0#1| 0)) (.cse19 (<= .cse1 127)) (.cse12 (< |c_ULTIMATE.start_main1_~g~0#1| 0))) (let ((.cse4 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse26 (not .cse12)) (.cse18 (not (= .cse1 0))) (.cse6 (+ .cse1 (- 256))) (.cse11 (not .cse19)) (.cse13 (not (= |c_ULTIMATE.start_main1_~y~0#1| 0))) (.cse14 (not .cse10)) (.cse17 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (= (mod (mod .cse32 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse32) 256) |c_ULTIMATE.start_main1_~g~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse32 0))))))) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse5 (+ (mod (+ .cse2 .cse3) 256) (- 256)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse5))) (and (not (= .cse0 0)) (<= .cse1 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= (mod (+ .cse2 .cse3 .cse0) 256) .cse4) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (= (mod .cse5 |c_ULTIMATE.start_main1_~g~0#1|) 0) (not (= .cse2 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse9 (mod .cse7 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse9))) (and (= .cse4 (mod (+ (* .cse7 255) .cse8) 256)) (not (= .cse8 0)) (<= .cse1 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (= (mod .cse9 |c_ULTIMATE.start_main1_~g~0#1|) 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse9 0))))))) .cse10 .cse11 .cse12) (and (or (and .cse13 .cse14 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse15 (+ (- 256) (mod (+ .cse16 .cse3) 256)))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse15) 256) |c_ULTIMATE.start_main1_~g~0#1|) (not (= .cse16 0)) (= (mod (mod .cse15 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_26|) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))) .cse17)) (and (or (and .cse18 .cse19 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse20 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse1) 256))) (and (= (mod .cse20 |c_ULTIMATE.start_main1_~g~0#1|) 0) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse20) 256) |c_ULTIMATE.start_main1_~g~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse20 0)) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_26|)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse1))) (let ((.cse21 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse22) 256)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse21) 256) |c_ULTIMATE.start_main1_~g~0#1|) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (not (= .cse22 0)) (= (mod .cse21 |c_ULTIMATE.start_main1_~g~0#1|) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6) 256))) (and (= (mod .cse23 |c_ULTIMATE.start_main1_~g~0#1|) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse23) 256) |c_ULTIMATE.start_main1_~g~0#1|))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse23 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse25 (+ (mod (+ .cse24 .cse3) 256) (- 256)))) (and (not (= .cse24 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse25) 256) |c_ULTIMATE.start_main1_~g~0#1|))) (= (mod (mod .cse25 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)))))) .cse11)) .cse10)) .cse26) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6))) (let ((.cse29 (mod .cse27 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse29))) (and (= .cse4 (mod (+ (* .cse27 255) .cse28) 256)) (not (= .cse28 0)) (<= .cse1 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse29 0)) (= (mod (mod .cse29 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0))))) .cse10 .cse11 .cse12) (and .cse26 (or (and .cse10 (or (and .cse18 .cse19 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int) (|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse30 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse1) 256))) (and (= (mod (mod .cse30 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse30) 256) |c_ULTIMATE.start_main1_~g~0#1|) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse30 0)) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_26|))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_25| Int)) (let ((.cse31 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_25| .cse6) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_26| 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse31) 256) |c_ULTIMATE.start_main1_~g~0#1|))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_25| 0)) (not (= .cse31 0)) (= (mod (mod .cse31 |c_ULTIMATE.start_main1_~g~0#1|) 256) 0)))) .cse11))) (and .cse13 .cse14 .cse17)))))))) (not (= |c_ULTIMATE.start_main1_~g~0#1| 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| 127)) is different from false [2022-11-23 14:35:15,998 WARN L233 SmtUtils]: Spent 45.87s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:35:17,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-23 14:36:00,631 WARN L233 SmtUtils]: Spent 41.08s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:36:00,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:36:00,641 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-11-23 14:36:00,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 14:36:00,642 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 9 [2022-11-23 14:36:00,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:36:00,643 INFO L225 Difference]: With dead ends: 31 [2022-11-23 14:36:00,643 INFO L226 Difference]: Without dead ends: 25 [2022-11-23 14:36:00,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 273.4s TimeCoverageRelationStatistics Valid=83, Invalid=246, Unknown=9, NotChecked=312, Total=650 [2022-11-23 14:36:00,646 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:36:00,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 125 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 2 Unknown, 54 Unchecked, 8.0s Time] [2022-11-23 14:36:00,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-23 14:36:00,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-23 14:36:00,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 14:36:00,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-11-23 14:36:00,669 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 9 [2022-11-23 14:36:00,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:36:00,670 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-11-23 14:36:00,670 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-23 14:36:00,670 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-11-23 14:36:00,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 14:36:00,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:36:00,671 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2022-11-23 14:36:00,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 14:36:00,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:36:00,872 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:36:00,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:36:00,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1916224945, now seen corresponding path program 3 times [2022-11-23 14:36:00,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:36:00,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695136130] [2022-11-23 14:36:00,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:36:00,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:36:00,883 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 14:36:00,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [672735311] [2022-11-23 14:36:00,884 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 14:36:00,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:36:00,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:36:00,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:36:00,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 14:36:01,065 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 14:36:01,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:36:01,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-23 14:36:01,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:36:28,533 WARN L233 SmtUtils]: Spent 22.16s on a formula simplification. DAG size of input: 103 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:37:36,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:37:36,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695136130] [2022-11-23 14:37:36,091 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 14:37:36,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672735311] [2022-11-23 14:37:36,091 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. [2022-11-23 14:37:36,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1852170856] [2022-11-23 14:37:36,093 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-23 14:37:36,093 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:37:36,093 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:37:36,094 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:37:36,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 139 [2022-11-23 14:37:36,095 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:37:36,098 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:158) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:273) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:221) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:156) ... 44 more [2022-11-23 14:37:36,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:37:36,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2022-11-23 14:37:36,101 ERROR L170 FreeRefinementEngine]: Strategy SIFA_TAIPAN failed to provide any proof altough trace is infeasible [2022-11-23 14:37:36,101 INFO L359 BasicCegarLoop]: Counterexample might be feasible [2022-11-23 14:37:36,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-23 14:37:36,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-23 14:37:36,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 14:37:36,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:37:36,327 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1] [2022-11-23 14:37:36,330 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 14:37:36,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:37:36 BoogieIcfgContainer [2022-11-23 14:37:36,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 14:37:36,353 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 14:37:36,353 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 14:37:36,353 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 14:37:36,354 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:26:03" (3/4) ... [2022-11-23 14:37:36,357 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 14:37:36,357 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 14:37:36,358 INFO L158 Benchmark]: Toolchain (without parser) took 693340.74ms. Allocated memory was 117.4MB in the beginning and 207.6MB in the end (delta: 90.2MB). Free memory was 75.1MB in the beginning and 126.1MB in the end (delta: -51.0MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2022-11-23 14:37:36,359 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 117.4MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:37:36,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.38ms. Allocated memory is still 117.4MB. Free memory was 74.8MB in the beginning and 63.5MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-23 14:37:36,366 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.64ms. Allocated memory is still 117.4MB. Free memory was 63.5MB in the beginning and 61.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:37:36,367 INFO L158 Benchmark]: Boogie Preprocessor took 57.05ms. Allocated memory is still 117.4MB. Free memory was 61.5MB in the beginning and 60.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:37:36,367 INFO L158 Benchmark]: RCFGBuilder took 393.99ms. Allocated memory is still 117.4MB. Free memory was 60.1MB in the beginning and 44.4MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 14:37:36,367 INFO L158 Benchmark]: TraceAbstraction took 692456.07ms. Allocated memory was 117.4MB in the beginning and 207.6MB in the end (delta: 90.2MB). Free memory was 43.9MB in the beginning and 126.1MB in the end (delta: -82.2MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2022-11-23 14:37:36,368 INFO L158 Benchmark]: Witness Printer took 4.28ms. Allocated memory is still 207.6MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:37:36,370 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 117.4MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.38ms. Allocated memory is still 117.4MB. Free memory was 74.8MB in the beginning and 63.5MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.64ms. Allocated memory is still 117.4MB. Free memory was 63.5MB in the beginning and 61.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.05ms. Allocated memory is still 117.4MB. Free memory was 61.5MB in the beginning and 60.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 393.99ms. Allocated memory is still 117.4MB. Free memory was 60.1MB in the beginning and 44.4MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 692456.07ms. Allocated memory was 117.4MB in the beginning and 207.6MB in the end (delta: 90.2MB). Free memory was 43.9MB in the beginning and 126.1MB in the end (delta: -82.2MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Witness Printer took 4.28ms. Allocated memory is still 207.6MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L108] COND TRUE __VERIFIER_nondet_int() [L109] CALL main1() [L49] signed char x = __VERIFIER_nondet_char(); [L50] signed char y = __VERIFIER_nondet_char(); [L51] signed char g; [L53] CALL, EXPR gcd_test(x, y) [L33] signed char t; [L35] COND TRUE a < (signed char)0 [L35] a = -a [L36] COND FALSE !(b < (signed char)0) [L38] COND TRUE b != (signed char)0 [L39] t = b [L40] b = a % b [L41] a = t [L38] COND TRUE b != (signed char)0 [L39] t = b [L40] b = a % b [L41] a = t [L38] COND TRUE b != (signed char)0 [L39] t = b [L40] b = a % b [L41] a = t [L38] COND TRUE b != (signed char)0 [L39] t = b [L40] b = a % b [L41] a = t [L38] COND TRUE b != (signed char)0 [L39] t = b [L40] b = a % b [L41] a = t [L38] COND FALSE !(b != (signed char)0) [L43] return a; [L53] RET, EXPR gcd_test(x, y) [L53] g = gcd_test(x, y) [L55] COND TRUE y > (signed char)0 [L56] CALL __VERIFIER_assert(y >= g) [L26] COND TRUE !(cond) [L27] reach_error() - UnprovableResult [Line: 102]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 25 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 692.4s, OverallIterations: 4, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 111.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 8.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 8.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 54 IncrementalHoareTripleChecker+Unchecked, 210 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 131 IncrementalHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 46 mSDtfsCounter, 131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 274.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 575.8s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 33 ConstructedInterpolants, 5 QuantifiedInterpolants, 7429 SizeOfPredicates, 18 NumberOfNonLiveVariables, 273 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW --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 add45819e4621ede17512a8acbf89201f3f4db1ab1bf97afdd66c20e4064e4cd --- 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-4e7fbc6 [2022-11-23 14:37:38,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:37:38,829 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:37:38,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:37:38,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:37:38,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:37:38,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:37:38,856 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:37:38,858 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:37:38,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:37:38,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:37:38,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:37:38,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:37:38,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:37:38,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:37:38,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:37:38,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:37:38,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:37:38,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:37:38,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:37:38,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:37:38,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:37:38,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:37:38,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:37:38,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:37:38,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:37:38,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:37:38,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:37:38,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:37:38,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:37:38,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:37:38,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:37:38,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:37:38,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:37:38,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:37:38,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:37:38,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:37:38,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:37:38,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:37:38,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:37:38,922 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:37:38,925 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-23 14:37:38,967 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:37:38,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:37:38,972 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:37:38,973 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:37:38,974 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:37:38,974 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:37:38,974 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:37:38,975 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:37:38,975 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:37:38,975 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:37:38,976 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:37:38,977 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:37:38,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:37:38,978 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:37:38,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:37:38,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:37:38,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 14:37:38,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:37:38,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 14:37:38,980 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 14:37:38,980 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 14:37:38,981 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 14:37:38,981 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:37:38,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 14:37:38,981 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:37:38,982 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 14:37:38,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:37:38,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 14:37:38,983 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:37:38,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:37:38,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:37:38,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:37:38,984 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 14:37:38,984 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-23 14:37:38,985 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 14:37:38,985 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 14:37:38,985 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:37:38,985 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 14:37:38,986 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/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_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW 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 -> add45819e4621ede17512a8acbf89201f3f4db1ab1bf97afdd66c20e4064e4cd [2022-11-23 14:37:39,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:37:39,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:37:39,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:37:39,404 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:37:39,405 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:37:39,406 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/combinations/gcd_2+newton_2_4.i [2022-11-23 14:37:42,688 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:37:42,982 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:37:42,983 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/sv-benchmarks/c/combinations/gcd_2+newton_2_4.i [2022-11-23 14:37:42,999 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/data/1e762c376/f3b1c6f61c7845c5806ebbdb21c6184d/FLAG79d20b9b7 [2022-11-23 14:37:43,017 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/data/1e762c376/f3b1c6f61c7845c5806ebbdb21c6184d [2022-11-23 14:37:43,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:37:43,022 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:37:43,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:37:43,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:37:43,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:37:43,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:37:43" (1/1) ... [2022-11-23 14:37:43,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cae04f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:43, skipping insertion in model container [2022-11-23 14:37:43,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:37:43" (1/1) ... [2022-11-23 14:37:43,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:37:43,077 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:37:43,263 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_bcf24615-72d1-4722-94f6-b1b6d747712b/sv-benchmarks/c/combinations/gcd_2+newton_2_4.i[1226,1239] [2022-11-23 14:37:43,292 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_bcf24615-72d1-4722-94f6-b1b6d747712b/sv-benchmarks/c/combinations/gcd_2+newton_2_4.i[2841,2854] [2022-11-23 14:37:43,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:37:43,310 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:37:43,327 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_bcf24615-72d1-4722-94f6-b1b6d747712b/sv-benchmarks/c/combinations/gcd_2+newton_2_4.i[1226,1239] [2022-11-23 14:37:43,340 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_bcf24615-72d1-4722-94f6-b1b6d747712b/sv-benchmarks/c/combinations/gcd_2+newton_2_4.i[2841,2854] [2022-11-23 14:37:43,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:37:43,359 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:37:43,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:43 WrapperNode [2022-11-23 14:37:43,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:37:43,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:37:43,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:37:43,362 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:37:43,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:43" (1/1) ... [2022-11-23 14:37:43,400 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:43" (1/1) ... [2022-11-23 14:37:43,423 INFO L138 Inliner]: procedures = 28, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 80 [2022-11-23 14:37:43,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:37:43,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:37:43,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:37:43,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:37:43,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:43" (1/1) ... [2022-11-23 14:37:43,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:43" (1/1) ... [2022-11-23 14:37:43,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:43" (1/1) ... [2022-11-23 14:37:43,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:43" (1/1) ... [2022-11-23 14:37:43,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:43" (1/1) ... [2022-11-23 14:37:43,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:43" (1/1) ... [2022-11-23 14:37:43,455 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:43" (1/1) ... [2022-11-23 14:37:43,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:43" (1/1) ... [2022-11-23 14:37:43,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:37:43,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:37:43,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:37:43,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:37:43,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:43" (1/1) ... [2022-11-23 14:37:43,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:37:43,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:37:43,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:37:43,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:37:43,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:37:43,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 14:37:43,572 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-23 14:37:43,572 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-23 14:37:43,572 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-23 14:37:43,572 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-23 14:37:43,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:37:43,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:37:43,699 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:37:43,702 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:37:52,508 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:37:52,516 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:37:52,516 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 14:37:52,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:37:52 BoogieIcfgContainer [2022-11-23 14:37:52,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:37:52,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:37:52,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:37:52,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:37:52,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:37:43" (1/3) ... [2022-11-23 14:37:52,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7ae779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:37:52, skipping insertion in model container [2022-11-23 14:37:52,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:43" (2/3) ... [2022-11-23 14:37:52,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7ae779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:37:52, skipping insertion in model container [2022-11-23 14:37:52,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:37:52" (3/3) ... [2022-11-23 14:37:52,530 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_4.i [2022-11-23 14:37:52,552 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:37:52,553 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 14:37:52,608 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:37:52,616 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;@717798d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:37:52,616 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-23 14:37:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 14:37:52,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 14:37:52,630 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:37:52,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:37:52,631 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:37:52,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:37:52,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-11-23 14:37:52,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:37:52,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242481261] [2022-11-23 14:37:52,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:37:52,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:37:52,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:37:52,663 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:37:52,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-23 14:37:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:37:52,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 14:37:52,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:37:52,991 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-23 14:37:52,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:37:52,994 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:37:52,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242481261] [2022-11-23 14:37:52,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242481261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:37:52,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:37:52,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:37:52,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676436611] [2022-11-23 14:37:53,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:37:53,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:37:53,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:37:53,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:37:53,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:37:53,063 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:53,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:37:53,187 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2022-11-23 14:37:53,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:37:53,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-23 14:37:53,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:37:53,199 INFO L225 Difference]: With dead ends: 68 [2022-11-23 14:37:53,199 INFO L226 Difference]: Without dead ends: 30 [2022-11-23 14:37:53,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:37:53,208 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:37:53,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:37:53,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-23 14:37:53,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-23 14:37:53,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 14:37:53,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-23 14:37:53,261 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2022-11-23 14:37:53,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:37:53,263 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-23 14:37:53,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:53,263 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-23 14:37:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 14:37:53,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:37:53,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:37:53,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-23 14:37:53,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:37:53,494 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:37:53,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:37:53,496 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2022-11-23 14:37:53,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:37:53,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530211250] [2022-11-23 14:37:53,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:37:53,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:37:53,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:37:53,503 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:37:53,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-23 14:37:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:37:53,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:37:53,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:37:53,756 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-23 14:37:53,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:37:53,756 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:37:53,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530211250] [2022-11-23 14:37:53,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1530211250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:37:53,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:37:53,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:37:53,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354327112] [2022-11-23 14:37:53,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:37:53,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:37:53,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:37:53,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:37:53,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:37:53,760 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:53,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:37:53,985 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-11-23 14:37:53,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:37:53,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-23 14:37:53,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:37:53,988 INFO L225 Difference]: With dead ends: 37 [2022-11-23 14:37:53,988 INFO L226 Difference]: Without dead ends: 31 [2022-11-23 14:37:53,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:37:53,990 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:37:53,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 84 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:37:53,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-23 14:37:53,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-11-23 14:37:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 14:37:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-23 14:37:53,998 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2022-11-23 14:37:53,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:37:53,999 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-23 14:37:53,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-23 14:37:54,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 14:37:54,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:37:54,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:37:54,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-23 14:37:54,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:37:54,227 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:37:54,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:37:54,228 INFO L85 PathProgramCache]: Analyzing trace with hash 149955676, now seen corresponding path program 1 times [2022-11-23 14:37:54,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:37:54,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224785630] [2022-11-23 14:37:54,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:37:54,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:37:54,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:37:54,231 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:37:54,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-23 14:37:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:37:54,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:37:54,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:37:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:37:54,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:37:54,496 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:37:54,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224785630] [2022-11-23 14:37:54,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224785630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:37:54,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:37:54,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:37:54,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079692722] [2022-11-23 14:37:54,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:37:54,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:37:54,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:37:54,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:37:54,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:37:54,500 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:54,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:37:54,643 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-11-23 14:37:54,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:37:54,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-23 14:37:54,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:37:54,646 INFO L225 Difference]: With dead ends: 38 [2022-11-23 14:37:54,646 INFO L226 Difference]: Without dead ends: 30 [2022-11-23 14:37:54,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:37:54,648 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:37:54,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 84 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:37:54,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-23 14:37:54,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-23 14:37:54,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 14:37:54,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-23 14:37:54,656 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 12 [2022-11-23 14:37:54,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:37:54,657 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-23 14:37:54,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:37:54,657 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-23 14:37:54,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 14:37:54,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:37:54,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:37:54,678 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-23 14:37:54,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:37:54,873 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:37:54,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:37:54,874 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2022-11-23 14:37:54,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:37:54,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510583919] [2022-11-23 14:37:54,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:37:54,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:37:54,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:37:54,876 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:37:54,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-23 14:37:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:37:54,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 14:37:54,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:37:55,643 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-23 14:37:55,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:37:56,465 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-23 14:37:56,466 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:37:56,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510583919] [2022-11-23 14:37:56,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510583919] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:37:56,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1663544679] [2022-11-23 14:37:56,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:37:56,467 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:37:56,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:37:56,475 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:37:56,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-11-23 14:37:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:37:56,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 14:37:56,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:37:57,023 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-23 14:37:57,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:37:57,188 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-23 14:37:57,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1663544679] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:37:57,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714250873] [2022-11-23 14:37:57,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:37:57,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:37:57,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:37:57,194 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:37:57,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 14:37:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:37:57,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-23 14:37:57,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:37:57,522 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-23 14:37:57,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:37:58,432 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-23 14:37:58,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714250873] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:37:58,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 14:37:58,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 7] total 18 [2022-11-23 14:37:58,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629280237] [2022-11-23 14:37:58,435 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 14:37:58,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-23 14:37:58,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:37:58,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-23 14:37:58,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-11-23 14:37:58,440 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:38:02,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:38:02,876 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-11-23 14:38:02,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-23 14:38:02,879 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-23 14:38:02,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:38:02,880 INFO L225 Difference]: With dead ends: 43 [2022-11-23 14:38:02,880 INFO L226 Difference]: Without dead ends: 20 [2022-11-23 14:38:02,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=248, Invalid=744, Unknown=0, NotChecked=0, Total=992 [2022-11-23 14:38:02,882 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 65 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:38:02,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 159 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-23 14:38:02,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-23 14:38:02,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-23 14:38:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-23 14:38:02,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-11-23 14:38:02,888 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2022-11-23 14:38:02,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:38:02,889 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-11-23 14:38:02,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:38:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-11-23 14:38:02,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 14:38:02,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:38:02,890 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:38:02,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 14:38:03,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-23 14:38:03,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-11-23 14:38:03,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt [2022-11-23 14:38:03,498 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:38:03,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:38:03,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1535073882, now seen corresponding path program 1 times [2022-11-23 14:38:03,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:38:03,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110437120] [2022-11-23 14:38:03,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:38:03,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:38:03,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:38:03,501 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 14:38:03,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcf24615-72d1-4722-94f6-b1b6d747712b/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process