./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_2_8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_8.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c398287975b44a672accc5dcc25b28e536e19f2a0478c0e2a0b4b73bd7a8e18 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 19:33:08,731 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 19:33:08,792 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 19:33:08,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 19:33:08,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 19:33:08,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 19:33:08,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 19:33:08,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 19:33:08,823 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 19:33:08,824 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 19:33:08,824 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 19:33:08,825 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 19:33:08,826 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 19:33:08,826 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 19:33:08,827 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 19:33:08,827 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 19:33:08,828 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 19:33:08,828 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 19:33:08,829 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 19:33:08,829 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 19:33:08,830 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 19:33:08,832 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 19:33:08,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 19:33:08,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 19:33:08,833 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 19:33:08,834 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 19:33:08,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 19:33:08,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 19:33:08,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 19:33:08,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 19:33:08,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 19:33:08,836 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 19:33:08,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 19:33:08,837 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 19:33:08,837 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 19:33:08,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 19:33:08,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 19:33:08,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:33:08,838 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 19:33:08,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 19:33:08,838 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 19:33:08,839 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 19:33:08,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 19:33:08,839 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 19:33:08,839 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 19:33:08,839 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 19:33:08,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 19:33:08,840 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c398287975b44a672accc5dcc25b28e536e19f2a0478c0e2a0b4b73bd7a8e18 [2023-12-02 19:33:09,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 19:33:09,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 19:33:09,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 19:33:09,067 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 19:33:09,067 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 19:33:09,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/combinations/gcd_2+newton_2_8.i [2023-12-02 19:33:11,918 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 19:33:12,112 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 19:33:12,113 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i [2023-12-02 19:33:12,121 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/data/e27c8be66/76ae4f4104d1483ab009dcfff9865b39/FLAGfb6e96114 [2023-12-02 19:33:12,136 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/data/e27c8be66/76ae4f4104d1483ab009dcfff9865b39 [2023-12-02 19:33:12,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 19:33:12,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 19:33:12,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 19:33:12,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 19:33:12,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 19:33:12,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:33:12" (1/1) ... [2023-12-02 19:33:12,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ff0a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:12, skipping insertion in model container [2023-12-02 19:33:12,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:33:12" (1/1) ... [2023-12-02 19:33:12,174 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:33:12,328 WARN L240 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_2ca8121f-b834-4ae1-ac50-8e9222ba2058/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i[1226,1239] [2023-12-02 19:33:12,352 WARN L240 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_2ca8121f-b834-4ae1-ac50-8e9222ba2058/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i[2841,2854] [2023-12-02 19:33:12,354 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:33:12,364 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 19:33:12,377 WARN L240 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_2ca8121f-b834-4ae1-ac50-8e9222ba2058/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i[1226,1239] [2023-12-02 19:33:12,388 WARN L240 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_2ca8121f-b834-4ae1-ac50-8e9222ba2058/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i[2841,2854] [2023-12-02 19:33:12,389 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:33:12,406 INFO L206 MainTranslator]: Completed translation [2023-12-02 19:33:12,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:12 WrapperNode [2023-12-02 19:33:12,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 19:33:12,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 19:33:12,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 19:33:12,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 19:33:12,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:12" (1/1) ... [2023-12-02 19:33:12,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:12" (1/1) ... [2023-12-02 19:33:12,444 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 88 [2023-12-02 19:33:12,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 19:33:12,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 19:33:12,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 19:33:12,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 19:33:12,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:12" (1/1) ... [2023-12-02 19:33:12,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:12" (1/1) ... [2023-12-02 19:33:12,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:12" (1/1) ... [2023-12-02 19:33:12,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:12" (1/1) ... [2023-12-02 19:33:12,462 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:12" (1/1) ... [2023-12-02 19:33:12,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:12" (1/1) ... [2023-12-02 19:33:12,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:12" (1/1) ... [2023-12-02 19:33:12,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:12" (1/1) ... [2023-12-02 19:33:12,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 19:33:12,471 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 19:33:12,472 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 19:33:12,472 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 19:33:12,472 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:12" (1/1) ... [2023-12-02 19:33:12,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:33:12,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:33:12,500 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 19:33:12,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 19:33:12,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 19:33:12,531 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-12-02 19:33:12,532 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-12-02 19:33:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-12-02 19:33:12,532 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-12-02 19:33:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 19:33:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 19:33:12,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 19:33:12,608 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 19:33:12,611 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 19:33:12,756 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 19:33:12,813 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 19:33:12,814 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 19:33:12,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:33:12 BoogieIcfgContainer [2023-12-02 19:33:12,815 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 19:33:12,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 19:33:12,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 19:33:12,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 19:33:12,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:33:12" (1/3) ... [2023-12-02 19:33:12,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77cfac4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:33:12, skipping insertion in model container [2023-12-02 19:33:12,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:33:12" (2/3) ... [2023-12-02 19:33:12,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77cfac4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:33:12, skipping insertion in model container [2023-12-02 19:33:12,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:33:12" (3/3) ... [2023-12-02 19:33:12,825 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_8.i [2023-12-02 19:33:12,843 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 19:33:12,844 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-02 19:33:12,888 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 19:33:12,893 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=LoopHeads, 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;@5b80dd9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 19:33:12,893 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-02 19:33:12,896 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) [2023-12-02 19:33:12,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 19:33:12,903 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:33:12,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 19:33:12,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:33:12,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:33:12,910 INFO L85 PathProgramCache]: Analyzing trace with hash -584909265, now seen corresponding path program 1 times [2023-12-02 19:33:12,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:33:12,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519306478] [2023-12-02 19:33:12,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:33:12,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:33:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:33:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:33:13,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:33:13,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519306478] [2023-12-02 19:33:13,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519306478] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:33:13,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:33:13,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:33:13,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024206538] [2023-12-02 19:33:13,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:33:13,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:33:13,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:33:13,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:33:13,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:33:13,278 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) [2023-12-02 19:33:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:33:13,347 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2023-12-02 19:33:13,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:33:13,350 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 [2023-12-02 19:33:13,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:33:13,357 INFO L225 Difference]: With dead ends: 36 [2023-12-02 19:33:13,357 INFO L226 Difference]: Without dead ends: 21 [2023-12-02 19:33:13,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:33:13,364 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 19:33:13,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 19:33:13,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-02 19:33:13,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-02 19:33:13,401 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) [2023-12-02 19:33:13,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2023-12-02 19:33:13,403 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 6 [2023-12-02 19:33:13,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:33:13,403 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2023-12-02 19:33:13,404 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) [2023-12-02 19:33:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2023-12-02 19:33:13,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 19:33:13,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:33:13,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:33:13,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 19:33:13,406 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:33:13,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:33:13,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1018725074, now seen corresponding path program 1 times [2023-12-02 19:33:13,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:33:13,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877033886] [2023-12-02 19:33:13,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:33:13,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:33:13,425 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 19:33:13,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [187987806] [2023-12-02 19:33:13,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:33:13,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:33:13,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:33:13,430 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:33:13,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 19:33:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:33:13,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 19:33:13,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:33:13,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:33:13,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:33:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:33:13,973 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:33:13,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877033886] [2023-12-02 19:33:13,973 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 19:33:13,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187987806] [2023-12-02 19:33:13,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187987806] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:33:13,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1104244625] [2023-12-02 19:33:14,002 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 19:33:14,003 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:33:14,008 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:33:14,015 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:33:14,016 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:33:15,748 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:33:16,029 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '151#(and (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main1_~x~0#1| 127) (<= (+ |ULTIMATE.start_main1_~y~0#1| 1) |ULTIMATE.start_main1_~g~0#1|) (<= 1 |ULTIMATE.start_main1_~y~0#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 (+ |ULTIMATE.start_main1_~x~0#1| 128)) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))' at error location [2023-12-02 19:33:16,029 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:33:16,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:33:16,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-02 19:33:16,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191762069] [2023-12-02 19:33:16,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:33:16,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 19:33:16,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:33:16,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 19:33:16,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-12-02 19:33:16,033 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) [2023-12-02 19:33:16,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:33:16,165 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2023-12-02 19:33:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 19:33:16,167 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 [2023-12-02 19:33:16,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:33:16,167 INFO L225 Difference]: With dead ends: 28 [2023-12-02 19:33:16,168 INFO L226 Difference]: Without dead ends: 23 [2023-12-02 19:33:16,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-12-02 19:33:16,170 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:33:16,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 83 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 19:33:16,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-02 19:33:16,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-02 19:33:16,176 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) [2023-12-02 19:33:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2023-12-02 19:33:16,176 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 7 [2023-12-02 19:33:16,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:33:16,177 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-12-02 19:33:16,177 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) [2023-12-02 19:33:16,177 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2023-12-02 19:33:16,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 19:33:16,178 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:33:16,178 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2023-12-02 19:33:16,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 19:33:16,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-02 19:33:16,380 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:33:16,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:33:16,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1867278002, now seen corresponding path program 2 times [2023-12-02 19:33:16,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 19:33:16,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253310498] [2023-12-02 19:33:16,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:33:16,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 19:33:16,392 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-02 19:33:16,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [446493521] [2023-12-02 19:33:16,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 19:33:16,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:33:16,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:33:16,394 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:33:16,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 19:33:16,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 19:33:16,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 19:33:16,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-02 19:33:16,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:33:44,486 WARN L293 SmtUtils]: Spent 19.81s on a formula simplification. DAG size of input: 165 DAG size of output: 153 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 19:36:32,014 WARN L854 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (let ((.cse7 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (let ((.cse79 (mod |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse78 (mod .cse7 256))) (let ((.cse13 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse14 (<= 128 .cse78)) (.cse15 (<= .cse79 127)) (.cse4 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse8 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse0 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (and (let ((.cse10 (mod .cse0 256))) (let ((.cse27 (not (= .cse10 0))) (.cse28 (<= .cse10 127)) (.cse55 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse1 (+ .cse10 (- 256))) (.cse2 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse3 (<= 128 .cse10))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (<= (mod (+ (mod (+ (- 256) (mod (+ .cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse1)) 256)) |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127)) .cse2 .cse3) (and .cse4 (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse10))) (let ((.cse9 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse6) 256)))) (let ((.cse5 (mod .cse9 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (= .cse5 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (not (= .cse6 0)) (<= (mod (+ .cse0 .cse6) 256) 127) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse5) 256) 127) (= (mod (+ .cse7 .cse5) 256) .cse8) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse9) 256))))))) (<= .cse10 |v_ULTIMATE.start_gcd_test_~a#1_31|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse10))) (let ((.cse12 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse11) 256)))) (and (<= 128 (mod (+ .cse0 .cse11) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= .cse10 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= (mod .cse12 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse12) 256)))))) .cse13 .cse14 .cse15) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse10))) (let ((.cse16 (mod .cse18 256))) (let ((.cse17 (mod .cse16 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse16) 256)) (<= .cse10 |v_ULTIMATE.start_gcd_test_~a#1_31|))) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse17 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (<= (mod (+ .cse0 .cse18) 256) 127) (not (= .cse16 0)) (<= 128 (mod (+ .cse17 .cse7) 256)) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse17) 256) 127)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse10))) (let ((.cse21 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse19) 256)))) (let ((.cse20 (mod .cse21 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 128 (mod (+ .cse0 .cse19) 256)) (not (= .cse20 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse20) 256) 127) (= (mod (+ .cse7 .cse20) 256) .cse8) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse21) 256))))))) (<= .cse10 |v_ULTIMATE.start_gcd_test_~a#1_31|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse10))) (let ((.cse23 (mod .cse22 256))) (let ((.cse24 (mod .cse23 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 128 (mod (+ .cse0 .cse22) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse23) 256)) (<= .cse10 |v_ULTIMATE.start_gcd_test_~a#1_31|))) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse24 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (<= 128 (mod (+ .cse24 .cse7) 256)) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse24) 256) 127)))))) (and .cse13 .cse14 .cse15 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse10))) (let ((.cse25 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse26) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= .cse10 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= (mod .cse25 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse26 0)) (<= (mod (+ .cse0 .cse26) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse25) 256)))))))) .cse27 .cse28) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse1))) (let ((.cse30 (+ (- 256) (mod (+ .cse0 .cse29) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse29) 256) 127) (= (mod .cse30 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse29 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse30) 256)))))))) .cse13 .cse14 .cse15) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse1) 256))) (let ((.cse31 (mod .cse32 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 128 (mod (+ .cse31 .cse7) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= (mod .cse31 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse32 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse32) 256)))) (<= (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse1))) (let ((.cse33 (+ (- 256) (mod (+ .cse0 .cse34) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod .cse33 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse34 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse34) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse33) 256)))))))) .cse13 .cse14 .cse15) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse1))) (let ((.cse37 (+ (- 256) (mod (+ .cse0 .cse36) 256)))) (let ((.cse35 (mod .cse37 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod .cse35 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (not (= .cse36 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse36) 256)) (= (mod (+ .cse35 .cse7) 256) .cse8) (not (= .cse35 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse37) 256))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse1))) (let ((.cse40 (+ (- 256) (mod (+ .cse0 .cse39) 256)))) (let ((.cse38 (mod .cse40 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod .cse38 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ .cse38 |c_ULTIMATE.start_gcd_test_~a#1|) 256) 127) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse39) 256) 127) (not (= .cse39 0)) (= (mod (+ .cse38 .cse7) 256) .cse8) (not (= .cse38 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse40) 256)))))))))) .cse3))) (and (or (and .cse27 .cse28 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse10))) (let ((.cse43 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse41) 256)))) (let ((.cse42 (mod .cse43 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 128 (mod (+ .cse0 .cse41) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= .cse10 |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse42) 256)) (= (mod (+ .cse7 .cse42) 256) .cse8) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse43) 256))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse10))) (let ((.cse47 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse46) 256)))) (let ((.cse44 (mod .cse47 |c_ULTIMATE.start_gcd_test_~a#1|))) (let ((.cse45 (mod (+ .cse7 .cse44) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= .cse10 |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse44) 256)) (<= 128 .cse45) (not (= .cse46 0)) (<= (mod (+ .cse0 .cse46) 256) 127) (= .cse45 .cse8) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse47) 256)))))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse1))) (let ((.cse50 (+ (- 256) (mod (+ .cse0 .cse49) 256)))) (let ((.cse48 (mod .cse50 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 128 (mod (+ .cse48 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= (mod .cse48 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse49) 256) 127) (not (= .cse49 0)) (= (mod (+ .cse48 .cse7) 256) .cse8) (not (= .cse48 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse50) 256))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse1))) (let ((.cse53 (+ (- 256) (mod (+ .cse0 .cse52) 256)))) (let ((.cse51 (mod .cse53 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 128 (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= (mod .cse51 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (not (= .cse52 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse52) 256)) (= (mod (+ .cse51 .cse7) 256) .cse8) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse53) 256)))))))))) .cse3)) .cse4) (and .cse2 (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse1))) (let ((.cse57 (+ (- 256) (mod (+ .cse0 .cse56) 256)))) (let ((.cse54 (mod .cse57 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod .cse54 256) 127) (<= 128 (mod (+ .cse54 .cse7) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= .cse10 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_31|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_31| 1) 0) (= .cse55 (mod (+ .cse0 .cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse57)) 256)))) (not (= .cse56 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse56) 256)) (= .cse8 (mod (+ .cse54 |c_ULTIMATE.start_gcd_test_~a#1|) 256))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse59 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse1))) (let ((.cse60 (+ (- 256) (mod (+ .cse0 .cse59) 256)))) (let ((.cse58 (mod .cse60 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod .cse58 256) 127) (<= 128 (mod (+ .cse58 .cse7) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse59) 256) 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= .cse10 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_31|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_31| 1) 0) (= .cse55 (mod (+ .cse0 .cse59 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse60)) 256)))) (not (= .cse59 0)) (= .cse8 (mod (+ .cse58 |c_ULTIMATE.start_gcd_test_~a#1|) 256)))))))) .cse3) (and (let ((.cse64 (<= 128 .cse79)) (.cse65 (<= .cse78 127))) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse62 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse1))) (let ((.cse63 (+ (- 256) (mod (+ .cse0 .cse62) 256)))) (let ((.cse61 (mod .cse63 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod .cse61 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse62) 256) 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= .cse10 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_31|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_31| 1) 0) (= .cse55 (mod (+ .cse0 .cse62 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse63)) 256)))) (not (= .cse62 0)) (<= (mod (+ .cse61 .cse7) 256) 127) (= .cse8 (mod (+ .cse61 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse61 0))))))) (and .cse64 .cse65 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse1))) (let ((.cse67 (+ (- 256) (mod (+ .cse0 .cse66) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse66) 256) 127) (= (mod .cse67 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse66 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (let ((.cse68 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse67))) (and (not (= .cse68 0)) (<= .cse10 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_31|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_31| 1) 0) (= .cse55 (mod (+ .cse0 .cse66 .cse68) 256))))))))) .cse13)) .cse2) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse70 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse1))) (let ((.cse71 (mod .cse70 256))) (let ((.cse69 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse71))) (and (not (= .cse69 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (<= .cse10 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_31|)) (= (mod (+ .cse69 (* 255 .cse70)) 256) .cse55) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_31| 1) 0) (= (mod (mod .cse71 |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse71 0))))))) .cse2) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse73 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse1))) (let ((.cse74 (+ (- 256) (mod (+ .cse0 .cse73) 256)))) (let ((.cse72 (mod .cse74 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod .cse72 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= .cse10 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_31|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_31| 1) 0) (= .cse55 (mod (+ .cse0 .cse73 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse74)) 256)))) (not (= .cse73 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse73) 256)) (<= (mod (+ .cse72 .cse7) 256) 127) (= .cse8 (mod (+ .cse72 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= .cse72 0))))))) (and .cse64 .cse65 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse76 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse1))) (let ((.cse75 (+ (- 256) (mod (+ .cse0 .cse76) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod .cse75 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse76 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (let ((.cse77 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse75))) (and (not (= .cse77 0)) (<= .cse10 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_31|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_31| 1) 0) (= .cse55 (mod (+ .cse0 .cse76 .cse77) 256))))) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse76) 256)))))) .cse13)) .cse2))) .cse3)))) (<= (+ |c_ULTIMATE.start_main1_~y~0#1| 1) 0)) (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse82 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse81 (+ (- 256) (mod (+ .cse0 .cse82) 256)))) (let ((.cse80 (mod .cse81 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod (+ .cse7 .cse80) 256) .cse8) (not (= .cse80 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse81) 256)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse82) 256)) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse80) 256) 127)))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|))) (and .cse13 .cse14 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse84 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse83 (+ (- 256) (mod (+ .cse0 .cse84) 256)))) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse83) 256)) (= (mod .cse83 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse84) 256)))))) .cse15)) .cse4) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse85 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse87 (+ (- 256) (mod (+ .cse0 .cse85) 256)))) (let ((.cse86 (mod .cse87 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse85) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod (+ .cse7 .cse86) 256) .cse8) (not (= .cse86 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse87) 256)) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse86) 256) 127) (not (= .cse85 0))))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse88 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse89 (+ (- 256) (mod (+ .cse0 .cse88) 256)))) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse88) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse89) 256)) (= (mod .cse89 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse88 0)))))) .cse13 .cse14 .cse15)) .cse4) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse90 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse92 (+ (- 256) (mod (+ .cse0 .cse90) 256)))) (let ((.cse91 (mod .cse92 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse90) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod (+ .cse7 .cse91) 256) .cse8) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse92) 256)) (not (= .cse90 0)) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse91) 256))))))) .cse4) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse94 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse93 (mod .cse94 256))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse93) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse94) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse93 |c_ULTIMATE.start_gcd_test_~a#1|) 256)))))) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int)) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse95 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse96 (mod .cse95 256))) (and (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse95) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse96) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (not (= .cse96 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse96 |c_ULTIMATE.start_gcd_test_~a#1|) 256))))))))) .cse4) (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse99 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse98 (+ (- 256) (mod (+ .cse0 .cse99) 256)))) (let ((.cse97 (mod .cse98 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (= (mod (+ .cse7 .cse97) 256) .cse8) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse98) 256)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse99) 256)) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse97) 256))))))))))))))) is different from false [2023-12-02 19:36:46,315 WARN L854 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (let ((.cse5 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (and (<= (+ |c_ULTIMATE.start_main1_~y~0#1| 1) 0) (let ((.cse2 (mod .cse5 256))) (let ((.cse19 (+ .cse2 (- 256))) (.cse27 (<= 128 .cse2))) (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse2))) (let ((.cse3 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse4) 256)))) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse3))) (let ((.cse0 (mod .cse1 256))) (and (<= |c_ULTIMATE.start_main1_~g~0#1| .cse0) (<= 128 (mod (* .cse1 255) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= .cse2 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= (mod .cse3 .cse0) 0) (not (= .cse4 0)) (<= (mod (+ .cse5 .cse4) 256) 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse2))) (let ((.cse8 (mod .cse6 256))) (let ((.cse7 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse8) 256))) (and (<= 128 (mod (+ .cse5 .cse6) 256)) (<= .cse2 |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (not (= .cse7 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse7) (= 0 (mod (mod .cse8 .cse7) 256))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse2))) (let ((.cse12 (+ (- 256) (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse11) 256)))) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse12))) (let ((.cse9 (mod .cse10 256))) (and (<= |c_ULTIMATE.start_main1_~g~0#1| .cse9) (<= 128 (mod (* .cse10 255) 256)) (<= 128 (mod (+ .cse5 .cse11) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= .cse2 |v_ULTIMATE.start_gcd_test_~a#1_31|) (= (mod .cse12 .cse9) 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse2))) (let ((.cse15 (mod .cse14 256))) (let ((.cse13 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse15) 256))) (and (<= .cse2 |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (not (= .cse13 0)) (<= (mod (+ .cse5 .cse14) 256) 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse13) (= 0 (mod (mod .cse15 .cse13) 256)) (not (= .cse15 0)))))))) (not (= .cse2 0)) (<= .cse2 127)) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse19))) (let ((.cse18 (+ (- 256) (mod (+ .cse5 .cse17) 256)))) (let ((.cse16 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse18) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse16) (not (= .cse17 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse17) 256)) (not (= .cse16 0)) (= (mod .cse18 .cse16) 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse19) 256))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse23))) (let ((.cse20 (mod .cse22 256))) (let ((.cse21 (mod .cse23 .cse20))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse20) (= (mod .cse21 256) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (<= 128 (mod (+ (* .cse22 255) .cse21) 256)) (not (= .cse23 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse19))) (let ((.cse26 (+ (- 256) (mod (+ .cse5 .cse24) 256)))) (let ((.cse25 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse26) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse24) 256) 127) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse25) (not (= .cse24 0)) (not (= .cse25 0)) (= (mod .cse26 .cse25) 0))))))) .cse27) (and (let ((.cse30 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse19))) (let ((.cse28 (+ (- 256) (mod (+ .cse5 .cse32) 256)))) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse28))) (let ((.cse29 (mod (+ .cse5 .cse32 .cse31) 256))) (and (= (mod .cse28 (+ (- 256) .cse29)) 0) (<= .cse30 .cse29) (not (= .cse31 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (not (= .cse32 0)) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse32) 256)) (<= .cse2 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_31|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_31| 1) 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse19))) (let ((.cse33 (+ (- 256) (mod (+ .cse5 .cse36) 256)))) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse33))) (let ((.cse34 (mod (+ .cse5 .cse36 .cse35) 256))) (and (= (mod .cse33 (+ (- 256) .cse34)) 0) (<= .cse30 .cse34) (not (= .cse35 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse36) 256) 127) (not (= .cse36 0)) (<= .cse2 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_31|)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_31| 1) 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse19))) (let ((.cse39 (mod .cse40 256))) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse39))) (let ((.cse38 (mod (+ .cse37 (* 255 .cse40)) 256))) (and (not (= .cse37 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (<= .cse2 (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_31|)) (<= .cse30 .cse38) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_31| 1) 0) (not (= .cse39 0)) (= (mod (mod .cse39 (+ .cse38 (- 256))) 256) 0))))))))) .cse27))))) (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse41 (+ (- 256) (mod (+ .cse5 .cse43) 256)))) (let ((.cse42 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse41) 256))) (and (= (mod .cse41 .cse42) 0) (not (= .cse42 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse42) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse43) 256) 127) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (not (= .cse43 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse45 (mod .cse46 256))) (let ((.cse44 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse45) 256))) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (not (= .cse44 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= (mod (mod .cse45 .cse44) 256) 0) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse46) 256)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse44)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse49 (mod .cse47 256))) (let ((.cse48 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse49) 256))) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse47) 256) 127) (not (= .cse48 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_30|) (= (mod (mod .cse49 .cse48) 256) 0) (not (= .cse49 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse48)))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_31| Int) (|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse50 (+ (- 256) (mod (+ .cse5 .cse52) 256)))) (let ((.cse51 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_31| .cse50) 256))) (and (= (mod .cse50 .cse51) 0) (not (= .cse51 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_31|) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse51) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1) 0) (<= 128 (mod (+ |c_ULTIMATE.start_main1_~y~0#1| .cse52) 256)))))))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|))))) is different from false [2023-12-02 19:36:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2023-12-02 19:36:48,799 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:39:10,528 WARN L293 SmtUtils]: Spent 1.27m on a formula simplification. DAG size of input: 88 DAG size of output: 56 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 19:42:37,313 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse0 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse3 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse6 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse10 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse5 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod .cse5 256))) (let ((.cse4 (+ (- 256) .cse1))) (let ((.cse2 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse4) 256))) (or (< .cse1 128) (< .cse2 .cse3) (not (= (mod (mod .cse4 .cse2) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse5 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse5 .cse6) 256) 128))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse8 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod (+ .cse8 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse7 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse9) 256))) (or (< .cse7 .cse3) (< (mod .cse8 256) 128) (not (= (mod (mod .cse9 .cse7) 256) 0)) (= 0 .cse9) (< 127 .cse9) (< (mod (+ .cse8 .cse6) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) (or .cse10 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse12 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse13 (mod .cse12 256))) (let ((.cse11 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse13) 256))) (or (< .cse11 .cse3) (< (mod (+ .cse12 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse13 0) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod (mod .cse13 .cse11) 256) 0)) (< 127 .cse13) (< (mod (+ .cse12 .cse6) 256) 128)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse15 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod (+ .cse15 .cse6) 256))) (let ((.cse16 (+ (- 256) .cse17))) (let ((.cse14 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse16) 256))) (or (< .cse14 .cse3) (< (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (not (= (mod (mod .cse16 .cse14) 256) 0)) (< 127 (mod .cse15 256)) (< .cse17 128) (= .cse15 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse19 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod .cse19 256))) (let ((.cse18 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse20) 256))) (or (< .cse18 .cse3) (< (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse20 0) (< 127 (mod (+ .cse19 .cse6) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod (mod .cse20 .cse18) 256) 0)) (< 127 .cse20)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse24 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse23 (mod (+ .cse24 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse21 (+ (- 256) .cse23))) (let ((.cse22 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse21) 256))) (or (not (= (mod (mod .cse21 .cse22) 256) 0)) (< .cse23 128) (< 127 (mod (+ .cse24 .cse6) 256)) (< 127 (mod .cse24 256)) (< .cse22 .cse3) (= .cse24 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse27 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (mod .cse27 256))) (let ((.cse25 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse26) 256))) (or (< .cse25 .cse3) (= .cse26 0) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod (mod .cse26 .cse25) 256) 0)) (< 127 .cse26) (< 127 (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse27 .cse6) 256) 128)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse30 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod (+ .cse30 .cse6) 256))) (let ((.cse29 (+ (- 256) .cse31))) (let ((.cse28 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse29) 256))) (or (< .cse28 .cse3) (not (= (mod (mod .cse29 .cse28) 256) 0)) (< 127 (mod .cse30 256)) (< 127 (mod (+ .cse30 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse31 128) (= .cse30 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) .cse10) (or .cse10 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse33 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse32 (mod .cse33 256))) (let ((.cse35 (+ (- 256) .cse32))) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse35) 256))) (or (< .cse32 128) (< (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse34 .cse3) (not (= (mod (mod .cse35 .cse34) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (+ .cse33 .cse6) 256) 128))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse36 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse39 (mod (+ .cse36 .cse6) 256))) (let ((.cse38 (+ (- 256) .cse39))) (let ((.cse37 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse38) 256))) (or (< (mod .cse36 256) 128) (< .cse37 .cse3) (< (mod (+ .cse36 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (not (= (mod (mod .cse38 .cse37) 256) 0)) (< .cse39 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse41 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse42 (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse42) 256))) (or (< .cse40 .cse3) (< (mod .cse41 256) 128) (not (= (mod (mod .cse42 .cse40) 256) 0)) (= 0 .cse42) (< 127 (mod (+ .cse41 .cse6) 256)) (< 127 .cse42) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse43 (mod .cse45 256))) (let ((.cse46 (+ (- 256) .cse43))) (let ((.cse44 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse46) 256))) (or (< .cse43 128) (< .cse44 .cse3) (< 127 (mod (+ .cse45 .cse6) 256)) (not (= (mod (mod .cse46 .cse44) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0)))) .cse0) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse49 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse48 (mod .cse49 256))) (let ((.cse47 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse48) 256))) (or (< .cse47 .cse3) (= .cse48 0) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod (mod .cse48 .cse47) 256) 0)) (< 127 .cse48) (< 127 (mod (+ .cse49 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse49 .cse6) 256) 128)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (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 ((.cse51 (mod (+ .cse52 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse50 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse51) 256))) (or (< .cse50 .cse3) (not (= (mod (mod .cse51 .cse50) 256) 0)) (= 0 .cse51) (< 127 (mod .cse52 256)) (< 127 .cse51) (< (mod (+ .cse52 .cse6) 256) 128) (= .cse52 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse55 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse54 (mod .cse55 256))) (let ((.cse53 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse54) 256))) (or (< .cse53 .cse3) (= .cse54 0) (< 127 (mod (+ .cse55 .cse6) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod (mod .cse54 .cse53) 256) 0)) (< 127 .cse54) (< 127 (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse58 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse57 (mod (+ .cse58 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse56 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse57) 256))) (or (< .cse56 .cse3) (not (= (mod (mod .cse57 .cse56) 256) 0)) (= 0 .cse57) (< 127 (mod (+ .cse58 .cse6) 256)) (< 127 (mod .cse58 256)) (< 127 .cse57) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0)))) .cse0) (or .cse10 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse61 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse60 (mod .cse61 256))) (let ((.cse59 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse60) 256))) (or (< .cse59 .cse3) (= .cse60 0) (< 127 (mod (+ .cse61 .cse6) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod (mod .cse60 .cse59) 256) 0)) (< 127 .cse60) (< 127 (mod (+ .cse61 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| 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 ((.cse62 (mod (+ .cse64 .cse6) 256))) (let ((.cse63 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse62) 256))) (or (not (= (mod (mod .cse62 .cse63) 256) 0)) (= .cse62 0) (< 127 .cse62) (< .cse63 .cse3) (< 127 (mod .cse64 256)) (< 127 (mod (+ .cse64 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse67 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse68 (mod (+ .cse67 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse65 (+ (- 256) .cse68))) (let ((.cse66 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse65) 256))) (or (not (= (mod (mod .cse65 .cse66) 256) 0)) (< (mod .cse67 256) 128) (< .cse68 128) (< 127 (mod (+ .cse67 .cse6) 256)) (< .cse66 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (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 ((.cse69 (mod .cse70 256))) (let ((.cse72 (+ (- 256) .cse69))) (let ((.cse71 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse72) 256))) (or (< .cse69 128) (< (mod (+ .cse70 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse71 .cse3) (< 127 (mod (+ .cse70 .cse6) 256)) (not (= (mod (mod .cse72 .cse71) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0)))) .cse0) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse75 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse73 (mod .cse75 256))) (let ((.cse76 (+ (- 256) .cse73))) (let ((.cse74 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse76) 256))) (or (< .cse73 128) (< .cse74 .cse3) (< 127 (mod (+ .cse75 .cse6) 256)) (not (= (mod (mod .cse76 .cse74) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse75 |c_ULTIMATE.start_gcd_test_~b#1|) 256)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| 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 ((.cse77 (mod (+ .cse79 .cse6) 256))) (let ((.cse78 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse77) 256))) (or (not (= (mod (mod .cse77 .cse78) 256) 0)) (< (mod .cse79 256) 128) (= .cse77 0) (< 127 .cse77) (< .cse78 .cse3) (< 127 (mod (+ .cse79 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse10) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse81 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse80 (mod .cse81 256))) (let ((.cse83 (+ (- 256) .cse80))) (let ((.cse82 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse83) 256))) (or (< .cse80 128) (< (mod (+ .cse81 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse82 .cse3) (not (= (mod (mod .cse83 .cse82) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (+ .cse81 .cse6) 256) 128))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse86 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse87 (mod (+ .cse86 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse84 (+ (- 256) .cse87))) (let ((.cse85 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse84) 256))) (or (not (= (mod (mod .cse84 .cse85) 256) 0)) (< (mod .cse86 256) 128) (< .cse87 128) (< (mod (+ .cse86 .cse6) 256) 128) (< .cse85 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| 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 ((.cse88 (mod (+ .cse90 .cse6) 256))) (let ((.cse89 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse88) 256))) (or (not (= (mod (mod .cse88 .cse89) 256) 0)) (< (mod (+ .cse90 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse88 0) (< 127 .cse88) (< .cse89 .cse3) (< 127 (mod .cse90 256)) (= .cse90 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| 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 ((.cse91 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse93) 256))) (or (< .cse91 .cse3) (< (mod (+ .cse92 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse93 0) (< 127 (mod (+ .cse92 .cse6) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod (mod .cse93 .cse91) 256) 0)) (< 127 .cse93)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse10) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (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 ((.cse94 (+ (- 256) .cse96))) (let ((.cse95 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse94) 256))) (or (not (= (mod (mod .cse94 .cse95) 256) 0)) (< .cse96 128) (< 127 (mod .cse97 256)) (< (mod (+ .cse97 .cse6) 256) 128) (< .cse95 .cse3) (= .cse97 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (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 ((.cse100 (mod .cse99 256))) (let ((.cse98 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse100) 256))) (or (< .cse98 .cse3) (< (mod (+ .cse99 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse100 0) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod (mod .cse100 .cse98) 256) 0)) (< 127 .cse100) (< (mod (+ .cse99 .cse6) 256) 128)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))))) (or .cse10 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (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 ((.cse104 (+ (- 256) .cse101))) (let ((.cse103 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse104) 256))) (or (< .cse101 128) (< (mod (+ .cse102 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse103 .cse3) (< 127 (mod (+ .cse102 .cse6) 256)) (not (= (mod (mod .cse104 .cse103) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (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 ((.cse105 (mod (+ .cse107 .cse6) 256))) (let ((.cse106 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse105) 256))) (or (not (= (mod (mod .cse105 .cse106) 256) 0)) (< (mod .cse107 256) 128) (< (mod (+ .cse107 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse105 0) (< 127 .cse105) (< .cse106 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse111 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse108 (mod .cse111 256))) (let ((.cse110 (+ (- 256) .cse108))) (let ((.cse109 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse110) 256))) (or (< .cse108 128) (< .cse109 .cse3) (not (= (mod (mod .cse110 .cse109) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse111 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse111 .cse6) 256) 128))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse112 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse115 (mod (+ .cse112 .cse6) 256))) (let ((.cse114 (+ (- 256) .cse115))) (let ((.cse113 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse114) 256))) (or (< (mod .cse112 256) 128) (< .cse113 .cse3) (not (= (mod (mod .cse114 .cse113) 256) 0)) (< 127 (mod (+ .cse112 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse115 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) .cse10))) (< |c_ULTIMATE.start_main1_~y~0#1| 1) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2023-12-02 19:42:38,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-12-02 19:42:38,025 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 19:42:38,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253310498] [2023-12-02 19:42:38,025 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-02 19:42:38,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446493521] [2023-12-02 19:42:38,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446493521] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:42:38,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1146193604] [2023-12-02 19:42:38,027 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 19:42:38,027 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 19:42:38,028 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 19:42:38,028 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 19:42:38,028 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 19:42:39,168 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 19:42:49,900 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '293#(and (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main1_~x~0#1| 127) (<= (+ |ULTIMATE.start_main1_~y~0#1| 1) |ULTIMATE.start_main1_~g~0#1|) (<= 1 |ULTIMATE.start_main1_~y~0#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 (+ |ULTIMATE.start_main1_~x~0#1| 128)) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))' at error location [2023-12-02 19:42:49,901 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 19:42:49,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 19:42:49,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-02 19:42:49,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192572671] [2023-12-02 19:42:49,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 19:42:49,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 19:42:49,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 19:42:49,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 19:42:49,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=198, Unknown=7, NotChecked=90, Total=342 [2023-12-02 19:42:49,903 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) [2023-12-02 19:42:52,063 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 [] [2023-12-02 19:42:54,127 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main1_~y~0#1| 1))) (and (or (let ((.cse0 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse6 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse10 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse5 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod .cse5 256))) (let ((.cse4 (+ (- 256) .cse1))) (let ((.cse2 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse4) 256))) (or (< .cse1 128) (< .cse2 .cse3) (not (= (mod (mod .cse4 .cse2) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse5 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse5 .cse6) 256) 128))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse8 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod (+ .cse8 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse7 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse9) 256))) (or (< .cse7 .cse3) (< (mod .cse8 256) 128) (not (= (mod (mod .cse9 .cse7) 256) 0)) (= 0 .cse9) (< 127 .cse9) (< (mod (+ .cse8 .cse6) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) (or .cse10 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse12 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse13 (mod .cse12 256))) (let ((.cse11 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse13) 256))) (or (< .cse11 .cse3) (< (mod (+ .cse12 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse13 0) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod (mod .cse13 .cse11) 256) 0)) (< 127 .cse13) (< (mod (+ .cse12 .cse6) 256) 128)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse15 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod (+ .cse15 .cse6) 256))) (let ((.cse16 (+ (- 256) .cse17))) (let ((.cse14 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse16) 256))) (or (< .cse14 .cse3) (< (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (not (= (mod (mod .cse16 .cse14) 256) 0)) (< 127 (mod .cse15 256)) (< .cse17 128) (= .cse15 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse19 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod .cse19 256))) (let ((.cse18 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse20) 256))) (or (< .cse18 .cse3) (< (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse20 0) (< 127 (mod (+ .cse19 .cse6) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod (mod .cse20 .cse18) 256) 0)) (< 127 .cse20)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse24 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse23 (mod (+ .cse24 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse21 (+ (- 256) .cse23))) (let ((.cse22 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse21) 256))) (or (not (= (mod (mod .cse21 .cse22) 256) 0)) (< .cse23 128) (< 127 (mod (+ .cse24 .cse6) 256)) (< 127 (mod .cse24 256)) (< .cse22 .cse3) (= .cse24 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse27 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (mod .cse27 256))) (let ((.cse25 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse26) 256))) (or (< .cse25 .cse3) (= .cse26 0) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod (mod .cse26 .cse25) 256) 0)) (< 127 .cse26) (< 127 (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse27 .cse6) 256) 128)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse30 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod (+ .cse30 .cse6) 256))) (let ((.cse29 (+ (- 256) .cse31))) (let ((.cse28 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse29) 256))) (or (< .cse28 .cse3) (not (= (mod (mod .cse29 .cse28) 256) 0)) (< 127 (mod .cse30 256)) (< 127 (mod (+ .cse30 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse31 128) (= .cse30 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) .cse10) (or .cse10 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse33 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse32 (mod .cse33 256))) (let ((.cse35 (+ (- 256) .cse32))) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse35) 256))) (or (< .cse32 128) (< (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse34 .cse3) (not (= (mod (mod .cse35 .cse34) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (+ .cse33 .cse6) 256) 128))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse36 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse39 (mod (+ .cse36 .cse6) 256))) (let ((.cse38 (+ (- 256) .cse39))) (let ((.cse37 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse38) 256))) (or (< (mod .cse36 256) 128) (< .cse37 .cse3) (< (mod (+ .cse36 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (not (= (mod (mod .cse38 .cse37) 256) 0)) (< .cse39 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse41 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse42 (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse42) 256))) (or (< .cse40 .cse3) (< (mod .cse41 256) 128) (not (= (mod (mod .cse42 .cse40) 256) 0)) (= 0 .cse42) (< 127 (mod (+ .cse41 .cse6) 256)) (< 127 .cse42) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse43 (mod .cse45 256))) (let ((.cse46 (+ (- 256) .cse43))) (let ((.cse44 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse46) 256))) (or (< .cse43 128) (< .cse44 .cse3) (< 127 (mod (+ .cse45 .cse6) 256)) (not (= (mod (mod .cse46 .cse44) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0)))) .cse0) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse49 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse48 (mod .cse49 256))) (let ((.cse47 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse48) 256))) (or (< .cse47 .cse3) (= .cse48 0) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod (mod .cse48 .cse47) 256) 0)) (< 127 .cse48) (< 127 (mod (+ .cse49 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse49 .cse6) 256) 128)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (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 ((.cse51 (mod (+ .cse52 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse50 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse51) 256))) (or (< .cse50 .cse3) (not (= (mod (mod .cse51 .cse50) 256) 0)) (= 0 .cse51) (< 127 (mod .cse52 256)) (< 127 .cse51) (< (mod (+ .cse52 .cse6) 256) 128) (= .cse52 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse55 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse54 (mod .cse55 256))) (let ((.cse53 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse54) 256))) (or (< .cse53 .cse3) (= .cse54 0) (< 127 (mod (+ .cse55 .cse6) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod (mod .cse54 .cse53) 256) 0)) (< 127 .cse54) (< 127 (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse58 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse57 (mod (+ .cse58 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse56 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse57) 256))) (or (< .cse56 .cse3) (not (= (mod (mod .cse57 .cse56) 256) 0)) (= 0 .cse57) (< 127 (mod (+ .cse58 .cse6) 256)) (< 127 (mod .cse58 256)) (< 127 .cse57) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0)))) .cse0) (or .cse10 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse61 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse60 (mod .cse61 256))) (let ((.cse59 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse60) 256))) (or (< .cse59 .cse3) (= .cse60 0) (< 127 (mod (+ .cse61 .cse6) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod (mod .cse60 .cse59) 256) 0)) (< 127 .cse60) (< 127 (mod (+ .cse61 |c_ULTIMATE.start_gcd_test_~b#1|) 256))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| 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 ((.cse62 (mod (+ .cse64 .cse6) 256))) (let ((.cse63 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse62) 256))) (or (not (= (mod (mod .cse62 .cse63) 256) 0)) (= .cse62 0) (< 127 .cse62) (< .cse63 .cse3) (< 127 (mod .cse64 256)) (< 127 (mod (+ .cse64 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse67 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse68 (mod (+ .cse67 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse65 (+ (- 256) .cse68))) (let ((.cse66 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse65) 256))) (or (not (= (mod (mod .cse65 .cse66) 256) 0)) (< (mod .cse67 256) 128) (< .cse68 128) (< 127 (mod (+ .cse67 .cse6) 256)) (< .cse66 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (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 ((.cse69 (mod .cse70 256))) (let ((.cse72 (+ (- 256) .cse69))) (let ((.cse71 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse72) 256))) (or (< .cse69 128) (< (mod (+ .cse70 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse71 .cse3) (< 127 (mod (+ .cse70 .cse6) 256)) (not (= (mod (mod .cse72 .cse71) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0)))) .cse0) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse75 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse73 (mod .cse75 256))) (let ((.cse76 (+ (- 256) .cse73))) (let ((.cse74 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse76) 256))) (or (< .cse73 128) (< .cse74 .cse3) (< 127 (mod (+ .cse75 .cse6) 256)) (not (= (mod (mod .cse76 .cse74) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse75 |c_ULTIMATE.start_gcd_test_~b#1|) 256)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| 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 ((.cse77 (mod (+ .cse79 .cse6) 256))) (let ((.cse78 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse77) 256))) (or (not (= (mod (mod .cse77 .cse78) 256) 0)) (< (mod .cse79 256) 128) (= .cse77 0) (< 127 .cse77) (< .cse78 .cse3) (< 127 (mod (+ .cse79 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse10) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse81 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse80 (mod .cse81 256))) (let ((.cse83 (+ (- 256) .cse80))) (let ((.cse82 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse83) 256))) (or (< .cse80 128) (< (mod (+ .cse81 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse82 .cse3) (not (= (mod (mod .cse83 .cse82) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< (mod (+ .cse81 .cse6) 256) 128))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse86 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse87 (mod (+ .cse86 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse84 (+ (- 256) .cse87))) (let ((.cse85 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse84) 256))) (or (not (= (mod (mod .cse84 .cse85) 256) 0)) (< (mod .cse86 256) 128) (< .cse87 128) (< (mod (+ .cse86 .cse6) 256) 128) (< .cse85 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| 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 ((.cse88 (mod (+ .cse90 .cse6) 256))) (let ((.cse89 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse88) 256))) (or (not (= (mod (mod .cse88 .cse89) 256) 0)) (< (mod (+ .cse90 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse88 0) (< 127 .cse88) (< .cse89 .cse3) (< 127 (mod .cse90 256)) (= .cse90 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| 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 ((.cse91 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse93) 256))) (or (< .cse91 .cse3) (< (mod (+ .cse92 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse93 0) (< 127 (mod (+ .cse92 .cse6) 256)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod (mod .cse93 .cse91) 256) 0)) (< 127 .cse93)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse10) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (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 ((.cse94 (+ (- 256) .cse96))) (let ((.cse95 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse94) 256))) (or (not (= (mod (mod .cse94 .cse95) 256) 0)) (< .cse96 128) (< 127 (mod .cse97 256)) (< (mod (+ .cse97 .cse6) 256) 128) (< .cse95 .cse3) (= .cse97 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (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 ((.cse100 (mod .cse99 256))) (let ((.cse98 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse100) 256))) (or (< .cse98 .cse3) (< (mod (+ .cse99 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse100 0) (< |ULTIMATE.start_gcd_test_~a#1| 0) (not (= (mod (mod .cse100 .cse98) 256) 0)) (< 127 .cse100) (< (mod (+ .cse99 .cse6) 256) 128)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| 0))))) (or .cse10 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (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 ((.cse104 (+ (- 256) .cse101))) (let ((.cse103 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse104) 256))) (or (< .cse101 128) (< (mod (+ .cse102 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< .cse103 .cse3) (< 127 (mod (+ .cse102 .cse6) 256)) (not (= (mod (mod .cse104 .cse103) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (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 ((.cse105 (mod (+ .cse107 .cse6) 256))) (let ((.cse106 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse105) 256))) (or (not (= (mod (mod .cse105 .cse106) 256) 0)) (< (mod .cse107 256) 128) (< (mod (+ .cse107 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (= .cse105 0) (< 127 .cse105) (< .cse106 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse111 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse108 (mod .cse111 256))) (let ((.cse110 (+ (- 256) .cse108))) (let ((.cse109 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse110) 256))) (or (< .cse108 128) (< .cse109 .cse3) (not (= (mod (mod .cse110 .cse109) 256) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 (mod (+ .cse111 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse111 .cse6) 256) 128))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_36| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_36| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse112 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse115 (mod (+ .cse112 .cse6) 256))) (let ((.cse114 (+ (- 256) .cse115))) (let ((.cse113 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_36| .cse114) 256))) (or (< (mod .cse112 256) 128) (< .cse113 .cse3) (not (= (mod (mod .cse114 .cse113) 256) 0)) (< 127 (mod (+ .cse112 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse115 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) .cse10))) (< |c_ULTIMATE.start_main1_~y~0#1| 1) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (and (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|)) (and (let ((.cse116 (mod (* |c_ULTIMATE.start_main1_~y~0#1| 255) 256))) (or (and (= .cse116 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (<= 128 .cse116)) (and (= .cse116 |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse116 127)))) (<= .cse3 0))))) is different from true [2023-12-02 19:42:59,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-02 19:43:01,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-02 19:43:03,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-12-02 19:43:03,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 139 [2023-12-02 19:43:03,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 129.7s TimeCoverageRelationStatistics Valid=55, Invalid=225, Unknown=8, NotChecked=132, Total=420 [2023-12-02 19:43:03,957 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-12-02 19:43:03,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 3 Unknown, 27 Unchecked, 8.2s Time] [2023-12-02 19:43:03,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 19:43:04,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:43:04,160 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:665) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:365) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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:175) ... 36 more [2023-12-02 19:43:04,162 INFO L158 Benchmark]: Toolchain (without parser) took 592022.17ms. Allocated memory was 138.4MB in the beginning and 251.7MB in the end (delta: 113.2MB). Free memory was 107.5MB in the beginning and 120.0MB in the end (delta: -12.5MB). Peak memory consumption was 102.5MB. Max. memory is 16.1GB. [2023-12-02 19:43:04,163 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory is still 53.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 19:43:04,163 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.91ms. Allocated memory is still 138.4MB. Free memory was 107.1MB in the beginning and 95.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-12-02 19:43:04,163 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.96ms. Allocated memory is still 138.4MB. Free memory was 95.7MB in the beginning and 93.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 19:43:04,164 INFO L158 Benchmark]: Boogie Preprocessor took 25.84ms. Allocated memory is still 138.4MB. Free memory was 93.8MB in the beginning and 92.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 19:43:04,164 INFO L158 Benchmark]: RCFGBuilder took 344.17ms. Allocated memory is still 138.4MB. Free memory was 92.5MB in the beginning and 76.8MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-12-02 19:43:04,165 INFO L158 Benchmark]: TraceAbstraction took 591343.36ms. Allocated memory was 138.4MB in the beginning and 251.7MB in the end (delta: 113.2MB). Free memory was 76.1MB in the beginning and 120.0MB in the end (delta: -43.9MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. [2023-12-02 19:43:04,167 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory is still 53.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.91ms. Allocated memory is still 138.4MB. Free memory was 107.1MB in the beginning and 95.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.96ms. Allocated memory is still 138.4MB. Free memory was 95.7MB in the beginning and 93.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.84ms. Allocated memory is still 138.4MB. Free memory was 93.8MB in the beginning and 92.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 344.17ms. Allocated memory is still 138.4MB. Free memory was 92.5MB in the beginning and 76.8MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 591343.36ms. Allocated memory was 138.4MB in the beginning and 251.7MB in the end (delta: 113.2MB). Free memory was 76.1MB in the beginning and 120.0MB in the end (delta: -43.9MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_8.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c398287975b44a672accc5dcc25b28e536e19f2a0478c0e2a0b4b73bd7a8e18 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 19:43:05,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 19:43:05,903 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 19:43:05,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 19:43:05,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 19:43:05,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 19:43:05,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 19:43:05,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 19:43:05,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 19:43:05,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 19:43:05,940 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 19:43:05,940 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 19:43:05,941 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 19:43:05,941 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 19:43:05,942 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 19:43:05,942 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 19:43:05,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 19:43:05,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 19:43:05,945 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 19:43:05,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 19:43:05,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 19:43:05,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 19:43:05,948 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 19:43:05,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 19:43:05,949 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 19:43:05,950 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 19:43:05,950 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 19:43:05,951 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 19:43:05,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 19:43:05,951 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 19:43:05,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 19:43:05,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 19:43:05,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 19:43:05,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 19:43:05,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:43:05,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 19:43:05,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 19:43:05,954 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 19:43:05,954 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 19:43:05,954 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 19:43:05,955 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 19:43:05,955 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 19:43:05,955 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 19:43:05,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 19:43:05,956 INFO L153 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_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c398287975b44a672accc5dcc25b28e536e19f2a0478c0e2a0b4b73bd7a8e18 [2023-12-02 19:43:06,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 19:43:06,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 19:43:06,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 19:43:06,279 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 19:43:06,279 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 19:43:06,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/combinations/gcd_2+newton_2_8.i [2023-12-02 19:43:09,087 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 19:43:09,274 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 19:43:09,274 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i [2023-12-02 19:43:09,283 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/data/9efb44d9d/02123a951dfb4c8f9773e0793f825ab7/FLAG97c75ff55 [2023-12-02 19:43:09,298 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/data/9efb44d9d/02123a951dfb4c8f9773e0793f825ab7 [2023-12-02 19:43:09,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 19:43:09,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 19:43:09,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 19:43:09,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 19:43:09,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 19:43:09,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:43:09" (1/1) ... [2023-12-02 19:43:09,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@436f2566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:43:09, skipping insertion in model container [2023-12-02 19:43:09,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:43:09" (1/1) ... [2023-12-02 19:43:09,332 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 19:43:09,465 WARN L240 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_2ca8121f-b834-4ae1-ac50-8e9222ba2058/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i[1226,1239] [2023-12-02 19:43:09,492 WARN L240 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_2ca8121f-b834-4ae1-ac50-8e9222ba2058/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i[2841,2854] [2023-12-02 19:43:09,493 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:43:09,508 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 19:43:09,521 WARN L240 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_2ca8121f-b834-4ae1-ac50-8e9222ba2058/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i[1226,1239] [2023-12-02 19:43:09,533 WARN L240 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_2ca8121f-b834-4ae1-ac50-8e9222ba2058/sv-benchmarks/c/combinations/gcd_2+newton_2_8.i[2841,2854] [2023-12-02 19:43:09,534 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 19:43:09,549 INFO L206 MainTranslator]: Completed translation [2023-12-02 19:43:09,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:43:09 WrapperNode [2023-12-02 19:43:09,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 19:43:09,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 19:43:09,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 19:43:09,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 19:43:09,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:43:09" (1/1) ... [2023-12-02 19:43:09,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:43:09" (1/1) ... [2023-12-02 19:43:09,587 INFO L138 Inliner]: procedures = 28, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 83 [2023-12-02 19:43:09,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 19:43:09,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 19:43:09,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 19:43:09,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 19:43:09,596 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:43:09" (1/1) ... [2023-12-02 19:43:09,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:43:09" (1/1) ... [2023-12-02 19:43:09,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:43:09" (1/1) ... [2023-12-02 19:43:09,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:43:09" (1/1) ... [2023-12-02 19:43:09,610 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:43:09" (1/1) ... [2023-12-02 19:43:09,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:43:09" (1/1) ... [2023-12-02 19:43:09,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:43:09" (1/1) ... [2023-12-02 19:43:09,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:43:09" (1/1) ... [2023-12-02 19:43:09,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 19:43:09,624 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 19:43:09,624 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 19:43:09,624 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 19:43:09,625 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:43:09" (1/1) ... [2023-12-02 19:43:09,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 19:43:09,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:43:09,656 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 19:43:09,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 19:43:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 19:43:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 19:43:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-12-02 19:43:09,693 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-12-02 19:43:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-12-02 19:43:09,693 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-12-02 19:43:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 19:43:09,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 19:43:09,780 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 19:43:09,782 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 19:43:17,190 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 19:43:17,227 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 19:43:17,227 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 19:43:17,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:43:17 BoogieIcfgContainer [2023-12-02 19:43:17,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 19:43:17,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 19:43:17,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 19:43:17,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 19:43:17,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:43:09" (1/3) ... [2023-12-02 19:43:17,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733548c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:43:17, skipping insertion in model container [2023-12-02 19:43:17,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:43:09" (2/3) ... [2023-12-02 19:43:17,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733548c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:43:17, skipping insertion in model container [2023-12-02 19:43:17,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:43:17" (3/3) ... [2023-12-02 19:43:17,238 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_8.i [2023-12-02 19:43:17,266 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 19:43:17,266 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-02 19:43:17,334 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 19:43:17,341 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=LoopHeads, 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;@6cfdc057, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 19:43:17,341 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-02 19:43:17,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 23 states have internal predecessors, (32), 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) [2023-12-02 19:43:17,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 19:43:17,353 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:43:17,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:43:17,354 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:43:17,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:43:17,359 INFO L85 PathProgramCache]: Analyzing trace with hash -22013170, now seen corresponding path program 1 times [2023-12-02 19:43:17,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:43:17,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641871600] [2023-12-02 19:43:17,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:43:17,372 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 [2023-12-02 19:43:17,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:43:17,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 19:43:17,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 19:43:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:43:17,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 19:43:17,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:43:17,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:43:17,591 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:43:17,592 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:43:17,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641871600] [2023-12-02 19:43:17,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641871600] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:43:17,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:43:17,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 19:43:17,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163113359] [2023-12-02 19:43:17,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:43:17,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 19:43:17,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:43:17,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 19:43:17,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:43:17,631 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 23 states have internal predecessors, (32), 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.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:43:20,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:43:22,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:43:26,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:43:28,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-02 19:43:28,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:43:28,716 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2023-12-02 19:43:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 19:43:28,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-02 19:43:28,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:43:28,727 INFO L225 Difference]: With dead ends: 55 [2023-12-02 19:43:28,727 INFO L226 Difference]: Without dead ends: 26 [2023-12-02 19:43:28,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 19:43:28,734 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2023-12-02 19:43:28,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 11.1s Time] [2023-12-02 19:43:28,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-02 19:43:28,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-02 19:43:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 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) [2023-12-02 19:43:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-12-02 19:43:28,771 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 9 [2023-12-02 19:43:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:43:28,771 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-12-02 19:43:28,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:43:28,772 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-12-02 19:43:28,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 19:43:28,773 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:43:28,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:43:28,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 19:43:28,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 19:43:28,974 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:43:28,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:43:28,975 INFO L85 PathProgramCache]: Analyzing trace with hash 35245132, now seen corresponding path program 1 times [2023-12-02 19:43:28,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:43:28,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462380149] [2023-12-02 19:43:28,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:43:28,976 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 [2023-12-02 19:43:28,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:43:28,978 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 19:43:28,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 19:43:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:43:29,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 19:43:29,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:43:29,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:43:29,207 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:43:29,207 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:43:29,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462380149] [2023-12-02 19:43:29,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462380149] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:43:29,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:43:29,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:43:29,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930635312] [2023-12-02 19:43:29,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:43:29,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:43:29,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:43:29,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:43:29,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:43:29,212 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:43:32,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:43:34,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:43:36,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:43:39,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:43:41,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:43:43,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:43:43,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:43:43,827 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2023-12-02 19:43:44,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 19:43:44,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-02 19:43:44,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:43:44,076 INFO L225 Difference]: With dead ends: 32 [2023-12-02 19:43:44,077 INFO L226 Difference]: Without dead ends: 27 [2023-12-02 19:43:44,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 19:43:44,079 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:43:44,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 60 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 6 Unknown, 0 Unchecked, 14.6s Time] [2023-12-02 19:43:44,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-02 19:43:44,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-12-02 19:43:44,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 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) [2023-12-02 19:43:44,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-12-02 19:43:44,088 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 9 [2023-12-02 19:43:44,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:43:44,088 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-12-02 19:43:44,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 19:43:44,088 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-12-02 19:43:44,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 19:43:44,089 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:43:44,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:43:44,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-02 19:43:44,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 19:43:44,290 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:43:44,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:43:44,291 INFO L85 PathProgramCache]: Analyzing trace with hash -690722863, now seen corresponding path program 1 times [2023-12-02 19:43:44,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:43:44,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459682650] [2023-12-02 19:43:44,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:43:44,292 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 [2023-12-02 19:43:44,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:43:44,293 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 19:43:44,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 19:43:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:43:44,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 19:43:44,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:43:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 19:43:44,537 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 19:43:44,537 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:43:44,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459682650] [2023-12-02 19:43:44,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459682650] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 19:43:44,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 19:43:44,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 19:43:44,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124654200] [2023-12-02 19:43:44,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 19:43:44,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 19:43:44,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:43:44,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 19:43:44,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:43:44,540 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2023-12-02 19:43:47,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:43:49,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:43:51,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:43:55,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:43:57,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:43:59,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:43:59,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:43:59,104 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-12-02 19:43:59,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 19:43:59,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2023-12-02 19:43:59,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:43:59,333 INFO L225 Difference]: With dead ends: 33 [2023-12-02 19:43:59,333 INFO L226 Difference]: Without dead ends: 26 [2023-12-02 19:43:59,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 19:43:59,334 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2023-12-02 19:43:59,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 60 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 6 Unknown, 0 Unchecked, 14.6s Time] [2023-12-02 19:43:59,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-02 19:43:59,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-02 19:43:59,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 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) [2023-12-02 19:43:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-02 19:43:59,339 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 10 [2023-12-02 19:43:59,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:43:59,340 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-02 19:43:59,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2023-12-02 19:43:59,340 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-02 19:43:59,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 19:43:59,341 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:43:59,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:43:59,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 19:43:59,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 19:43:59,542 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:43:59,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:43:59,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1084284499, now seen corresponding path program 1 times [2023-12-02 19:43:59,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:43:59,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388223177] [2023-12-02 19:43:59,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:43:59,543 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 [2023-12-02 19:43:59,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:43:59,544 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 19:43:59,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 19:43:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:43:59,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 19:43:59,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:44:00,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:44:00,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:44:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:44:00,991 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 19:44:00,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388223177] [2023-12-02 19:44:00,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388223177] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:44:00,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [936133098] [2023-12-02 19:44:00,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:44:00,992 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 19:44:00,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 19:44:00,994 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 19:44:00,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-02 19:44:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:44:01,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 19:44:01,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:44:01,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:44:01,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:44:01,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:44:01,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [936133098] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:44:01,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446778073] [2023-12-02 19:44:01,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:44:01,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 19:44:01,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 19:44:01,587 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 19:44:01,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 19:44:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 19:44:01,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 19:44:01,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 19:44:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:44:01,901 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 19:44:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 19:44:02,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446778073] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 19:44:02,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 19:44:02,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 6] total 15 [2023-12-02 19:44:02,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566984455] [2023-12-02 19:44:02,717 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 19:44:02,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 19:44:02,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 19:44:02,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 19:44:02,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-12-02 19:44:02,719 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 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) [2023-12-02 19:44:07,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:09,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:11,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:13,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:15,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:17,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:19,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:21,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:23,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:25,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:27,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:29,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:31,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:33,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:38,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:40,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:42,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:44,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:46,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:48,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:50,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:52,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:54,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:56,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:44:58,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:45:00,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:45:02,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:45:05,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-02 19:45:05,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 19:45:05,296 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2023-12-02 19:45:05,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 19:45:05,297 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 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 10 [2023-12-02 19:45:05,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 19:45:05,297 INFO L225 Difference]: With dead ends: 35 [2023-12-02 19:45:05,298 INFO L226 Difference]: Without dead ends: 17 [2023-12-02 19:45:05,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2023-12-02 19:45:05,300 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 12 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.7s IncrementalHoareTripleChecker+Time [2023-12-02 19:45:05,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 150 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 71 Invalid, 28 Unknown, 0 Unchecked, 61.7s Time] [2023-12-02 19:45:05,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-02 19:45:05,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-02 19:45:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.0) internal successors, (10), 10 states have internal predecessors, (10), 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) [2023-12-02 19:45:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-12-02 19:45:05,305 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2023-12-02 19:45:05,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 19:45:05,305 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-12-02 19:45:05,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 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) [2023-12-02 19:45:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-12-02 19:45:05,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 19:45:05,307 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 19:45:05,307 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 19:45:05,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 19:45:05,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 19:45:05,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2023-12-02 19:45:05,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 19:45:05,908 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 19:45:05,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 19:45:05,909 INFO L85 PathProgramCache]: Analyzing trace with hash -148224385, now seen corresponding path program 1 times [2023-12-02 19:45:05,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 19:45:05,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552234973] [2023-12-02 19:45:05,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 19:45:05,909 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 [2023-12-02 19:45:05,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 19:45:05,910 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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) [2023-12-02 19:45:05,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 19:45:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 19:45:15,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 19:45:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 19:45:24,245 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2023-12-02 19:45:24,245 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 19:45:24,246 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-02 19:45:24,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-02 19:45:24,301 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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)] Ended with exit code 0 [2023-12-02 19:45:24,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 19:45:24,451 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-02 19:45:24,453 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 19:45:24,464 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-12-02 19:45:24,465 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-12-02 19:45:24,465 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-12-02 19:45:24,466 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-12-02 19:45:24,466 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-12-02 19:45:24,466 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated [2023-12-02 19:45:24,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:45:24 BoogieIcfgContainer [2023-12-02 19:45:24,472 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 19:45:24,473 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 19:45:24,473 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 19:45:24,473 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 19:45:24,473 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:43:17" (3/4) ... [2023-12-02 19:45:24,474 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 19:45:24,476 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-12-02 19:45:24,477 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-12-02 19:45:24,477 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-12-02 19:45:24,477 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-12-02 19:45:24,477 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-12-02 19:45:24,477 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated [2023-12-02 19:45:24,501 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 19:45:24,502 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 19:45:24,502 INFO L158 Benchmark]: Toolchain (without parser) took 135200.69ms. Allocated memory is still 113.2MB. Free memory was 89.8MB in the beginning and 75.8MB in the end (delta: 14.0MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2023-12-02 19:45:24,503 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 62.9MB. Free memory was 39.4MB in the beginning and 39.3MB in the end (delta: 70.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 19:45:24,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.16ms. Allocated memory is still 113.2MB. Free memory was 89.5MB in the beginning and 77.3MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 19:45:24,503 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.71ms. Allocated memory is still 113.2MB. Free memory was 77.3MB in the beginning and 75.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 19:45:24,504 INFO L158 Benchmark]: Boogie Preprocessor took 34.62ms. Allocated memory is still 113.2MB. Free memory was 75.2MB in the beginning and 73.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 19:45:24,504 INFO L158 Benchmark]: RCFGBuilder took 7604.30ms. Allocated memory is still 113.2MB. Free memory was 73.8MB in the beginning and 59.5MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-12-02 19:45:24,504 INFO L158 Benchmark]: TraceAbstraction took 127240.74ms. Allocated memory is still 113.2MB. Free memory was 58.8MB in the beginning and 77.9MB in the end (delta: -19.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 19:45:24,505 INFO L158 Benchmark]: Witness Printer took 29.21ms. Allocated memory is still 113.2MB. Free memory was 77.9MB in the beginning and 75.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 19:45:24,507 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 62.9MB. Free memory was 39.4MB in the beginning and 39.3MB in the end (delta: 70.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.16ms. Allocated memory is still 113.2MB. Free memory was 89.5MB in the beginning and 77.3MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.71ms. Allocated memory is still 113.2MB. Free memory was 77.3MB in the beginning and 75.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.62ms. Allocated memory is still 113.2MB. Free memory was 75.2MB in the beginning and 73.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 7604.30ms. Allocated memory is still 113.2MB. Free memory was 73.8MB in the beginning and 59.5MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 127240.74ms. Allocated memory is still 113.2MB. Free memory was 58.8MB in the beginning and 77.9MB in the end (delta: -19.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 29.21ms. Allocated memory is still 113.2MB. Free memory was 77.9MB in the beginning and 75.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 102]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L108] COND FALSE !(__VERIFIER_nondet_int()) [L111] CALL main2() [L90] float IN = __VERIFIER_nondet_float(); [L91] CALL assume_abort_if_not(IN > -2.0f && IN < 2.0f) [L75] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L91] RET assume_abort_if_not(IN > -2.0f && IN < 2.0f) [L93] CALL, EXPR f(IN) VAL [\old(x)=-1.4081326723098755] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; [L93] RET, EXPR f(IN) VAL [IN=-1.4081326723098755] [L93] CALL, EXPR fp(IN) VAL [\old(x)=-1.4081326723098755] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; [L93] RET, EXPR fp(IN) VAL [IN=-1.4081326723098755] [L93] float x = IN - f(IN)/fp(IN); [L95] CALL, EXPR f(x) VAL [\old(x)=4.000978946685791] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; [L95] RET, EXPR f(x) VAL [IN=-1.4081326723098755, x=4.000978946685791] [L95] CALL, EXPR fp(x) VAL [\old(x)=4.000978946685791] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; [L95] RET, EXPR fp(x) VAL [IN=-1.4081326723098755, x=4.000978946685791] [L95] x = x - f(x)/fp(x) [L101] COND TRUE !(x < 0.1) VAL [IN=-1.4081326723098755, x=3.4538729190826416] [L102] reach_error() VAL [IN=-1.4081326723098755, x=3.4538729190826416] - UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 127.1s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 103.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 44 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 101.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 322 SdHoareTripleChecker+Invalid, 99.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 231 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 91 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 10.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 79 ConstructedInterpolants, 1 QuantifiedInterpolants, 369 SizeOfPredicates, 23 NumberOfNonLiveVariables, 240 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 1/7 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-02 19:45:24,720 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-12-02 19:45:24,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ca8121f-b834-4ae1-ac50-8e9222ba2058/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE