./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_2_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6c5808fcdfedd93e514ea4bc51242b78bf5dcc9e332c7faf3dfcc4d6de127e2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 11:00:50,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:00:50,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:00:50,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:00:50,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:00:50,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:00:50,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:00:50,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:00:50,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:00:50,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:00:50,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:00:50,970 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:00:50,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:00:50,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:00:50,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:00:50,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:00:50,986 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:00:50,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:00:50,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:00:50,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:00:50,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:00:50,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:00:51,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:00:51,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:00:51,007 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:00:51,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:00:51,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:00:51,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:00:51,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:00:51,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:00:51,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:00:51,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:00:51,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:00:51,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:00:51,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:00:51,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:00:51,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:00:51,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:00:51,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:00:51,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:00:51,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:00:51,034 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 11:00:51,084 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:00:51,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:00:51,086 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:00:51,086 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:00:51,087 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:00:51,088 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:00:51,088 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:00:51,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:00:51,089 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:00:51,090 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:00:51,091 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:00:51,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:00:51,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:00:51,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:00:51,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:00:51,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:00:51,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:00:51,094 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:00:51,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:00:51,094 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:00:51,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:00:51,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:00:51,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:00:51,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:00:51,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:00:51,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:00:51,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:00:51,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:00:51,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:00:51,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:00:51,098 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:00:51,098 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:00:51,099 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:00:51,099 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/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_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> f6c5808fcdfedd93e514ea4bc51242b78bf5dcc9e332c7faf3dfcc4d6de127e2 [2022-11-20 11:00:51,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:00:51,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:00:51,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:00:51,484 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:00:51,485 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:00:51,487 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/combinations/gcd_2+newton_2_3.i [2022-11-20 11:00:54,705 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:00:54,925 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:00:54,926 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/sv-benchmarks/c/combinations/gcd_2+newton_2_3.i [2022-11-20 11:00:54,934 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/data/9ede990ac/9536176e627e4317bafcaa1336c59260/FLAGdc9b2259d [2022-11-20 11:00:54,959 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/data/9ede990ac/9536176e627e4317bafcaa1336c59260 [2022-11-20 11:00:54,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:00:54,969 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:00:54,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:00:54,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:00:54,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:00:54,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:00:54" (1/1) ... [2022-11-20 11:00:54,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60ffd7d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:54, skipping insertion in model container [2022-11-20 11:00:54,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:00:54" (1/1) ... [2022-11-20 11:00:54,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:00:55,018 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:00:55,217 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/sv-benchmarks/c/combinations/gcd_2+newton_2_3.i[1226,1239] [2022-11-20 11:00:55,244 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/sv-benchmarks/c/combinations/gcd_2+newton_2_3.i[2841,2854] [2022-11-20 11:00:55,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:00:55,263 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:00:55,276 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/sv-benchmarks/c/combinations/gcd_2+newton_2_3.i[1226,1239] [2022-11-20 11:00:55,290 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/sv-benchmarks/c/combinations/gcd_2+newton_2_3.i[2841,2854] [2022-11-20 11:00:55,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:00:55,306 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:00:55,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:55 WrapperNode [2022-11-20 11:00:55,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:00:55,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:00:55,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:00:55,312 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:00:55,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:55" (1/1) ... [2022-11-20 11:00:55,329 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:55" (1/1) ... [2022-11-20 11:00:55,353 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2022-11-20 11:00:55,353 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:00:55,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:00:55,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:00:55,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:00:55,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:55" (1/1) ... [2022-11-20 11:00:55,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:55" (1/1) ... [2022-11-20 11:00:55,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:55" (1/1) ... [2022-11-20 11:00:55,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:55" (1/1) ... [2022-11-20 11:00:55,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:55" (1/1) ... [2022-11-20 11:00:55,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:55" (1/1) ... [2022-11-20 11:00:55,382 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:55" (1/1) ... [2022-11-20 11:00:55,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:55" (1/1) ... [2022-11-20 11:00:55,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:00:55,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:00:55,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:00:55,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:00:55,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:55" (1/1) ... [2022-11-20 11:00:55,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:00:55,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:00:55,425 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:00:55,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:00:55,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:00:55,471 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-20 11:00:55,471 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-20 11:00:55,471 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-20 11:00:55,472 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-20 11:00:55,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:00:55,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:00:55,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:00:55,556 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:00:55,558 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:00:55,820 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:00:55,828 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:00:55,829 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 11:00:55,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:00:55 BoogieIcfgContainer [2022-11-20 11:00:55,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:00:55,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:00:55,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:00:55,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:00:55,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:00:54" (1/3) ... [2022-11-20 11:00:55,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6d427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:00:55, skipping insertion in model container [2022-11-20 11:00:55,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:00:55" (2/3) ... [2022-11-20 11:00:55,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6d427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:00:55, skipping insertion in model container [2022-11-20 11:00:55,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:00:55" (3/3) ... [2022-11-20 11:00:55,867 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_3.i [2022-11-20 11:00:55,891 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:00:55,891 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 11:00:55,986 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:00:55,994 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@31c995a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:00:55,995 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-20 11:00:55,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 11:00:56,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:00:56,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:00:56,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:00:56,006 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:00:56,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:00:56,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-11-20 11:00:56,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:00:56,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740370600] [2022-11-20 11:00:56,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:56,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:00:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:00:56,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:00:56,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740370600] [2022-11-20 11:00:56,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740370600] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:00:56,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:00:56,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:00:56,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991621398] [2022-11-20 11:00:56,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:00:56,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:00:56,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:00:56,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:00:56,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:00:56,339 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:00:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:00:56,463 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2022-11-20 11:00:56,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 11:00:56,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 11:00:56,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:00:56,502 INFO L225 Difference]: With dead ends: 90 [2022-11-20 11:00:56,503 INFO L226 Difference]: Without dead ends: 36 [2022-11-20 11:00:56,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:00:56,515 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 30 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:00:56,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 107 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:00:56,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-20 11:00:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-11-20 11:00:56,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 11:00:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-11-20 11:00:56,573 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2022-11-20 11:00:56,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:00:56,574 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-11-20 11:00:56,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:00:56,575 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-11-20 11:00:56,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:00:56,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:00:56,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:00:56,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:00:56,577 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:00:56,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:00:56,578 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2022-11-20 11:00:56,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:00:56,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555386964] [2022-11-20 11:00:56,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:56,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:00:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:56,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:00:56,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:00:56,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555386964] [2022-11-20 11:00:56,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555386964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:00:56,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:00:56,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:00:56,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16558359] [2022-11-20 11:00:56,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:00:56,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:00:56,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:00:56,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:00:56,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:00:56,719 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:00:56,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:00:56,747 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-11-20 11:00:56,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:00:56,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 11:00:56,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:00:56,749 INFO L225 Difference]: With dead ends: 36 [2022-11-20 11:00:56,750 INFO L226 Difference]: Without dead ends: 30 [2022-11-20 11:00:56,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:00:56,752 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:00:56,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:00:56,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-20 11:00:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-20 11:00:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 11:00:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-20 11:00:56,760 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-11-20 11:00:56,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:00:56,761 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-20 11:00:56,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:00:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-20 11:00:56,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 11:00:56,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:00:56,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:00:56,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:00:56,763 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:00:56,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:00:56,764 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2022-11-20 11:00:56,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:00:56,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498611540] [2022-11-20 11:00:56,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:56,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:00:56,794 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:00:56,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1582570010] [2022-11-20 11:00:56,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:56,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:00:56,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:00:56,809 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:00:56,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:00:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:00:56,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 11:00:56,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:00:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:00:57,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:00:57,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:00:57,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:00:57,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498611540] [2022-11-20 11:00:57,118 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:00:57,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582570010] [2022-11-20 11:00:57,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582570010] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:00:57,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:00:57,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-11-20 11:00:57,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294758505] [2022-11-20 11:00:57,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:00:57,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:00:57,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:00:57,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:00:57,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:00:57,121 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:00:57,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:00:57,213 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-11-20 11:00:57,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:00:57,213 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 11:00:57,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:00:57,214 INFO L225 Difference]: With dead ends: 37 [2022-11-20 11:00:57,214 INFO L226 Difference]: Without dead ends: 31 [2022-11-20 11:00:57,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:00:57,216 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:00:57,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 179 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:00:57,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-20 11:00:57,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-20 11:00:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 11:00:57,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-11-20 11:00:57,222 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 12 [2022-11-20 11:00:57,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:00:57,222 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-11-20 11:00:57,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:00:57,223 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-11-20 11:00:57,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 11:00:57,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:00:57,224 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:00:57,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 11:00:57,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:00:57,430 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:00:57,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:00:57,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1659957129, now seen corresponding path program 2 times [2022-11-20 11:00:57,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:00:57,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286224551] [2022-11-20 11:00:57,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:00:57,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:00:57,453 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:00:57,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1294070294] [2022-11-20 11:00:57,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:00:57,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:00:57,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:00:57,469 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:00:57,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:00:57,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:00:57,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:00:57,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 11:00:57,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:01:14,038 WARN L233 SmtUtils]: Spent 15.36s on a formula simplification. DAG size of input: 72 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:01:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:01:16,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:03:33,862 WARN L233 SmtUtils]: Spent 2.04m on a formula simplification. DAG size of input: 129 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:03:37,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:03:37,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:03:37,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286224551] [2022-11-20 11:03:37,156 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:03:37,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294070294] [2022-11-20 11:03:37,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294070294] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:03:37,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:03:37,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-11-20 11:03:37,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829371531] [2022-11-20 11:03:37,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:03:37,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 11:03:37,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:03:37,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 11:03:37,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=195, Unknown=1, NotChecked=0, Total=240 [2022-11-20 11:03:37,159 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:03:46,334 WARN L233 SmtUtils]: Spent 7.45s on a formula simplification. DAG size of input: 48 DAG size of output: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:03:46,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:03:46,347 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-11-20 11:03:46,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:03:46,348 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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 13 [2022-11-20 11:03:46,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:03:46,348 INFO L225 Difference]: With dead ends: 38 [2022-11-20 11:03:46,349 INFO L226 Difference]: Without dead ends: 32 [2022-11-20 11:03:46,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 156.9s TimeCoverageRelationStatistics Valid=51, Invalid=220, Unknown=1, NotChecked=0, Total=272 [2022-11-20 11:03:46,350 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:03:46,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 258 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2022-11-20 11:03:46,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-20 11:03:46,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-20 11:03:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 11:03:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-20 11:03:46,357 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 13 [2022-11-20 11:03:46,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:03:46,357 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-20 11:03:46,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:03:46,357 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-20 11:03:46,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:03:46,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:03:46,358 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:03:46,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:03:46,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:03:46,576 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:03:46,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:03:46,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1682229690, now seen corresponding path program 3 times [2022-11-20 11:03:46,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:03:46,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355304590] [2022-11-20 11:03:46,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:03:46,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:03:46,589 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:03:46,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1346518579] [2022-11-20 11:03:46,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 11:03:46,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:03:46,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:03:46,591 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:03:46,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:03:46,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 11:03:46,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:03:46,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-20 11:03:46,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:04:03,797 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification. DAG size of input: 55 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:05:07,904 WARN L233 SmtUtils]: Spent 54.07s on a formula simplification. DAG size of input: 88 DAG size of output: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:05:32,452 WARN L233 SmtUtils]: Spent 19.03s on a formula simplification. DAG size of input: 65 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:05:45,401 WARN L233 SmtUtils]: Spent 9.76s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:06:09,653 WARN L233 SmtUtils]: Spent 20.73s on a formula simplification. DAG size of input: 61 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:06:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:06:11,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:07:21,049 WARN L233 SmtUtils]: Spent 50.71s on a formula simplification. DAG size of input: 88 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:08:51,016 WARN L859 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (let ((.cse7 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (let ((.cse26 (not .cse7)) (.cse2 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse1 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod .cse1 256))) (let ((.cse3 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse0) 256))) (or (= .cse0 0) (<= (mod (+ .cse1 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse3) 256) 0)) (not (<= .cse0 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse0) (<= .cse3 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse6 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse5 (mod (+ .cse6 .cse2) 256))) (let ((.cse4 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse5)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse5 127) (not (<= (mod .cse6 256) 127)) (<= (mod (+ .cse6 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse4) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse5) (= .cse6 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse7) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse10 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod .cse10 256))) (let ((.cse8 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse9)) 256))) (or (<= .cse8 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse9) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse8) 256) 0)) (<= (mod (+ .cse10 .cse2) 256) 127) (<= .cse9 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod (+ .cse13 .cse2) 256))) (let ((.cse11 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse12)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse11 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse12 127) (<= (mod .cse13 256) 127) (<= (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse11) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse12)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse14 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse14 .cse2) 256))) (let ((.cse15 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse16)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse15 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse16 127) (not (<= (mod .cse14 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse15) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse16) (= .cse14 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod .cse18 256))) (let ((.cse19 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse17) 256))) (or (= .cse17 0) (not (<= (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse18 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse19) 256) 0)) (not (<= .cse17 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse17) (<= .cse19 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse7) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse20 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse21 (mod .cse20 256))) (let ((.cse22 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse21) 256))) (or (not (<= (mod (+ .cse20 .cse2) 256) 127)) (= .cse21 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse22) 256) 0)) (not (<= .cse21 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse21) (<= .cse22 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse23 (mod (+ .cse25 .cse2) 256))) (let ((.cse24 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse23) 256))) (or (not (<= .cse23 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse24) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse23) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse23 0) (<= .cse24 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse25 256) 127)) (<= (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse25 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse7) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod .cse29 256))) (let ((.cse27 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse28)) 256))) (or (<= .cse27 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse28) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse27) 256) 0)) (not (<= (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse29 .cse2) 256) 127) (<= .cse28 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse30) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse30 127)) (<= (mod (+ .cse31 .cse2) 256) 127) (<= (mod .cse31 256) 127) (= 0 .cse30) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse30) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse32) 256) 0)) (<= .cse32 |c_ULTIMATE.start_main1_~y~0#1|)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse35 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod (+ .cse35 .cse2) 256))) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse33) 256))) (or (not (<= .cse33 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse34) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse33) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse33 0) (<= .cse34 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse35 256) 127) (<= (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse37 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod .cse37 256))) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse38)) 256))) (or (<= .cse36 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse37 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse38) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse36) 256) 0)) (<= .cse38 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse37 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse7) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse39 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse40 (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse41 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse40) 256))) (or (not (<= (mod (+ .cse39 .cse2) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse40 127)) (= 0 .cse40) (not (<= (mod .cse39 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse40) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse41) 256) 0)) (<= .cse41 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse43 (mod .cse42 256))) (let ((.cse44 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse43) 256))) (or (not (<= (mod (+ .cse42 .cse2) 256) 127)) (= .cse43 0) (not (<= (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse44) 256) 0)) (not (<= .cse43 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse43) (<= .cse44 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod .cse45 256))) (let ((.cse47 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse46) 256))) (or (not (<= (mod (+ .cse45 .cse2) 256) 127)) (= .cse46 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse47) 256) 0)) (not (<= .cse46 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse46) (<= .cse47 |c_ULTIMATE.start_main1_~y~0#1|)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse48 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse49 (mod (+ .cse48 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse50 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse49)) 256))) (or (not (<= (mod (+ .cse48 .cse2) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod .cse48 256) 127)) (<= .cse49 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse49) (<= .cse50 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse50) 256) 0)) (= .cse48 0)))))))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse52 (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse53 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse52)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse51 .cse2) 256) 127) (not (<= (mod .cse51 256) 127)) (<= .cse52 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse52) (<= .cse53 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse53) 256) 0)) (= .cse51 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|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 ((.cse56 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse54) 256))) (or (= .cse54 0) (<= (mod (+ .cse55 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse56) 256) 0)) (not (<= .cse54 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse54) (<= .cse56 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse58 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse59 (mod .cse58 256))) (let ((.cse57 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse59)) 256))) (or (<= .cse57 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse58 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse59) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse57) 256) 0)) (not (<= (mod (+ .cse58 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse59 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse62 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse60 (mod (+ .cse62 .cse2) 256))) (let ((.cse61 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse60) 256))) (or (not (<= .cse60 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse61) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse60) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse60 0) (<= .cse61 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse62 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse64 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse63 (mod (+ .cse64 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse65 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse63) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse63 127)) (<= (mod (+ .cse64 .cse2) 256) 127) (= 0 .cse63) (not (<= (mod .cse64 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse63) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse65) 256) 0)) (<= .cse65 |c_ULTIMATE.start_main1_~y~0#1|) (= .cse64 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse67 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse66 (mod .cse67 256))) (let ((.cse68 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse66) 256))) (or (= .cse66 0) (not (<= (mod (+ .cse67 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse67 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse68) 256) 0)) (not (<= .cse66 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse66) (<= .cse68 |c_ULTIMATE.start_main1_~y~0#1|)))))))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse69 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse71 (mod (+ .cse69 .cse2) 256))) (let ((.cse70 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse71)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse69 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse70 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse71 127) (<= (mod .cse69 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse70) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse71)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse74 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse73 (mod .cse74 256))) (let ((.cse72 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse73)) 256))) (or (<= .cse72 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse73) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse72) 256) 0)) (not (<= (mod (+ .cse74 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse74 .cse2) 256) 127) (<= .cse73 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse75 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse76 (mod (+ .cse75 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse77 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse76)) 256))) (or (not (<= (mod (+ .cse75 .cse2) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse75 256) 127) (<= .cse76 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse76) (<= .cse77 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse77) 256) 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse79 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse80 (mod .cse79 256))) (let ((.cse78 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse80)) 256))) (or (<= .cse78 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse79 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse80) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse78) 256) 0)) (<= .cse80 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse79 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse83 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse82 (mod .cse83 256))) (let ((.cse81 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse82)) 256))) (or (<= .cse81 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse82) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse81) 256) 0)) (<= (mod (+ .cse83 .cse2) 256) 127) (<= .cse82 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse83 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse84 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse85 (mod (+ .cse84 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse86 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse85)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse84 .cse2) 256) 127) (<= (mod .cse84 256) 127) (<= .cse85 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse85) (<= .cse86 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse86) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse89 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse87 (mod (+ .cse89 .cse2) 256))) (let ((.cse88 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse87) 256))) (or (not (<= .cse87 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse88) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse87) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse89 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse87 0) (<= .cse88 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse89 256) 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse90 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse91 (mod .cse90 256))) (let ((.cse92 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse91) 256))) (or (not (<= (mod (+ .cse90 .cse2) 256) 127)) (= .cse91 0) (not (<= (mod (+ .cse90 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse92) 256) 0)) (not (<= .cse91 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse91) (<= .cse92 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse94 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse95 (mod .cse94 256))) (let ((.cse93 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse95)) 256))) (or (<= .cse93 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse94 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse95) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse93) 256) 0)) (not (<= (mod (+ .cse94 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse95 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse96 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse97 (mod (+ .cse96 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse98 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse97) 256))) (or (not (<= (mod (+ .cse96 .cse2) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse97 127)) (<= (mod .cse96 256) 127) (= 0 .cse97) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse97) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse98) 256) 0)) (<= .cse98 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0)))))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) is different from true [2022-11-20 11:09:16,875 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse2 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse1 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod .cse1 256))) (let ((.cse3 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse0) 256))) (or (= .cse0 0) (<= (mod (+ .cse1 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse3) 256) 0)) (not (<= .cse0 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse0) (<= .cse3 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse5 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod .cse5 256))) (let ((.cse4 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse6)) 256))) (or (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse5 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse6) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse4) 256) 0)) (not (<= (mod (+ .cse5 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse6 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse9 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod (+ .cse9 .cse2) 256))) (let ((.cse8 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse7) 256))) (or (not (<= .cse7 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse8) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse7) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse7 0) (<= .cse8 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse9 256) 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse10 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod (+ .cse10 .cse2) 256))) (let ((.cse11 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse12)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse11 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse12 127) (not (<= (mod .cse10 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse11) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse12) (= .cse10 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod .cse13 256))) (let ((.cse15 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse14) 256))) (or (not (<= (mod (+ .cse13 .cse2) 256) 127)) (= .cse14 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse15) 256) 0)) (not (<= .cse14 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse14) (<= .cse15 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse18 .cse2) 256))) (let ((.cse17 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse16) 256))) (or (not (<= .cse16 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse17) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse16) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse16 0) (<= .cse17 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse18 256) 127)) (<= (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse18 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse21 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod .cse21 256))) (let ((.cse19 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse20)) 256))) (or (<= .cse19 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse20) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse19) 256) 0)) (<= (mod (+ .cse21 .cse2) 256) 127) (<= .cse20 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse22 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod (+ .cse22 .cse2) 256))) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse24)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse22 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse23 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse24 127) (<= (mod .cse22 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse23) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse24)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse27 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod (+ .cse27 .cse2) 256))) (let ((.cse26 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse25) 256))) (or (not (<= .cse25 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse26) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse25) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse25 0) (<= .cse26 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse27 256) 127) (<= (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse28 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod .cse28 256))) (let ((.cse30 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse29) 256))) (or (not (<= (mod (+ .cse28 .cse2) 256) 127)) (= .cse29 0) (not (<= (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse30) 256) 0)) (not (<= .cse29 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse29) (<= .cse30 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse33 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod (+ .cse33 .cse2) 256))) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse31) 256))) (or (not (<= .cse31 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse32) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse31) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse31 0) (<= .cse32 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse33 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse36 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse35 (mod (+ .cse36 .cse2) 256))) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse35)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse34 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse35 127) (not (<= (mod .cse36 256) 127)) (<= (mod (+ .cse36 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse34) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse35) (= .cse36 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse39 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod (+ .cse39 .cse2) 256))) (let ((.cse37 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse38)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse37 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse38 127) (<= (mod .cse39 256) 127) (<= (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse37) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse38)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse41 (mod .cse42 256))) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse41)) 256))) (or (<= .cse40 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse41) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse40) 256) 0)) (not (<= (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse42 .cse2) 256) 127) (<= .cse41 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse44 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse45 (mod .cse44 256))) (let ((.cse43 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse45)) 256))) (or (<= .cse43 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse44 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse45) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse43) 256) 0)) (<= .cse45 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod .cse47 256))) (let ((.cse48 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse46) 256))) (or (= .cse46 0) (not (<= (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse47 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse48) 256) 0)) (not (<= .cse46 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse46) (<= .cse48 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) is different from true [2022-11-20 11:09:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 11:09:41,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:09:41,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355304590] [2022-11-20 11:09:41,833 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:09:41,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346518579] [2022-11-20 11:09:41,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346518579] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:09:41,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:09:41,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-11-20 11:09:41,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464514516] [2022-11-20 11:09:41,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:09:41,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-20 11:09:41,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:09:41,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-20 11:09:41,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=248, Unknown=6, NotChecked=66, Total=380 [2022-11-20 11:09:41,835 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 20 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) [2022-11-20 11:09:43,882 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (let ((.cse2 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse1 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod .cse1 256))) (let ((.cse3 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse0) 256))) (or (= .cse0 0) (<= (mod (+ .cse1 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse3) 256) 0)) (not (<= .cse0 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse0) (<= .cse3 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse5 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod .cse5 256))) (let ((.cse4 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse6)) 256))) (or (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse5 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse6) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse4) 256) 0)) (not (<= (mod (+ .cse5 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse6 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse9 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod (+ .cse9 .cse2) 256))) (let ((.cse8 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse7) 256))) (or (not (<= .cse7 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse8) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse7) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse7 0) (<= .cse8 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse9 256) 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse10 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod (+ .cse10 .cse2) 256))) (let ((.cse11 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse12)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse11 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse12 127) (not (<= (mod .cse10 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse11) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse12) (= .cse10 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod .cse13 256))) (let ((.cse15 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse14) 256))) (or (not (<= (mod (+ .cse13 .cse2) 256) 127)) (= .cse14 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse15) 256) 0)) (not (<= .cse14 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse14) (<= .cse15 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse18 .cse2) 256))) (let ((.cse17 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse16) 256))) (or (not (<= .cse16 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse17) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse16) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse16 0) (<= .cse17 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse18 256) 127)) (<= (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse18 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse21 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod .cse21 256))) (let ((.cse19 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse20)) 256))) (or (<= .cse19 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse20) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse19) 256) 0)) (<= (mod (+ .cse21 .cse2) 256) 127) (<= .cse20 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse22 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod (+ .cse22 .cse2) 256))) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse24)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse22 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse23 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse24 127) (<= (mod .cse22 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse23) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse24)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse27 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod (+ .cse27 .cse2) 256))) (let ((.cse26 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse25) 256))) (or (not (<= .cse25 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse26) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse25) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse25 0) (<= .cse26 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse27 256) 127) (<= (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse28 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod .cse28 256))) (let ((.cse30 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse29) 256))) (or (not (<= (mod (+ .cse28 .cse2) 256) 127)) (= .cse29 0) (not (<= (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse30) 256) 0)) (not (<= .cse29 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse29) (<= .cse30 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse33 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod (+ .cse33 .cse2) 256))) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse31) 256))) (or (not (<= .cse31 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse32) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse31) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse31 0) (<= .cse32 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse33 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse36 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse35 (mod (+ .cse36 .cse2) 256))) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse35)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse34 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse35 127) (not (<= (mod .cse36 256) 127)) (<= (mod (+ .cse36 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse34) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse35) (= .cse36 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse39 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod (+ .cse39 .cse2) 256))) (let ((.cse37 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse38)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse37 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse38 127) (<= (mod .cse39 256) 127) (<= (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse37) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse38)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse41 (mod .cse42 256))) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse41)) 256))) (or (<= .cse40 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse41) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse40) 256) 0)) (not (<= (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse42 .cse2) 256) 127) (<= .cse41 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse44 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse45 (mod .cse44 256))) (let ((.cse43 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse45)) 256))) (or (<= .cse43 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse44 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse45) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse43) 256) 0)) (<= .cse45 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod .cse47 256))) (let ((.cse48 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse46) 256))) (or (= .cse46 0) (not (<= (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse47 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse48) 256) 0)) (not (<= .cse46 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse46) (<= .cse48 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|)) is different from true [2022-11-20 11:09:45,938 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (let ((.cse0 (not .cse8))) (and .cse0 (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|) (or (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (let ((.cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse2 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod .cse2 256))) (let ((.cse4 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse1) 256))) (or (= .cse1 0) (<= (mod (+ .cse2 .cse3) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse4) 256) 0)) (not (<= .cse1 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse2 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse1) (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse7 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod (+ .cse7 .cse3) 256))) (let ((.cse5 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse6)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse5 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse6 127) (not (<= (mod .cse7 256) 127)) (<= (mod (+ .cse7 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse5) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse6) (= .cse7 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse8) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse11 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse10 (mod .cse11 256))) (let ((.cse9 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse10)) 256))) (or (<= .cse9 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse10) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse9) 256) 0)) (<= (mod (+ .cse11 .cse3) 256) 127) (<= .cse10 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse14 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse13 (mod (+ .cse14 .cse3) 256))) (let ((.cse12 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse13)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse12 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse13 127) (<= (mod .cse14 256) 127) (<= (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse12) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse13)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|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 .cse3) 256))) (let ((.cse16 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse17)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse16 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse17 127) (not (<= (mod .cse15 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse16) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse17) (= .cse15 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse19 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (mod .cse19 256))) (let ((.cse20 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse18) 256))) (or (= .cse18 0) (not (<= (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse19 .cse3) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse20) 256) 0)) (not (<= .cse18 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse18) (<= .cse20 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse8) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse21 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod .cse21 256))) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse22) 256))) (or (not (<= (mod (+ .cse21 .cse3) 256) 127)) (= .cse22 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse23) 256) 0)) (not (<= .cse22 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse22) (<= .cse23 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse26 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod (+ .cse26 .cse3) 256))) (let ((.cse25 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse24) 256))) (or (not (<= .cse24 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse25) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse24) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse24 0) (<= .cse25 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse26 256) 127)) (<= (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse26 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse8) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod .cse29 256))) (let ((.cse27 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse28)) 256))) (or (<= .cse27 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse28) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse27) 256) 0)) (not (<= (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse29 .cse3) 256) 127) (<= .cse28 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse30) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse30 127)) (<= (mod (+ .cse31 .cse3) 256) 127) (<= (mod .cse31 256) 127) (= 0 .cse30) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse30) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse32) 256) 0)) (<= .cse32 |c_ULTIMATE.start_main1_~y~0#1|)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse35 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod (+ .cse35 .cse3) 256))) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse33) 256))) (or (not (<= .cse33 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse34) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse33) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse33 0) (<= .cse34 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse35 256) 127) (<= (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse37 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod .cse37 256))) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse38)) 256))) (or (<= .cse36 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse37 .cse3) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse38) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse36) 256) 0)) (<= .cse38 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse37 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse8) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse39 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse40 (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse41 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse40) 256))) (or (not (<= (mod (+ .cse39 .cse3) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse40 127)) (= 0 .cse40) (not (<= (mod .cse39 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse40) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse41) 256) 0)) (<= .cse41 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse43 (mod .cse42 256))) (let ((.cse44 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse43) 256))) (or (not (<= (mod (+ .cse42 .cse3) 256) 127)) (= .cse43 0) (not (<= (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse44) 256) 0)) (not (<= .cse43 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse43) (<= .cse44 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod .cse45 256))) (let ((.cse47 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse46) 256))) (or (not (<= (mod (+ .cse45 .cse3) 256) 127)) (= .cse46 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse47) 256) 0)) (not (<= .cse46 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse46) (<= .cse47 |c_ULTIMATE.start_main1_~y~0#1|)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse48 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse49 (mod (+ .cse48 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse50 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse49)) 256))) (or (not (<= (mod (+ .cse48 .cse3) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod .cse48 256) 127)) (<= .cse49 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse49) (<= .cse50 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse50) 256) 0)) (= .cse48 0)))))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse52 (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse53 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse52)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse51 .cse3) 256) 127) (not (<= (mod .cse51 256) 127)) (<= .cse52 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse52) (<= .cse53 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse53) 256) 0)) (= .cse51 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|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 ((.cse56 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse54) 256))) (or (= .cse54 0) (<= (mod (+ .cse55 .cse3) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse56) 256) 0)) (not (<= .cse54 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse54) (<= .cse56 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse58 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse59 (mod .cse58 256))) (let ((.cse57 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse59)) 256))) (or (<= .cse57 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse58 .cse3) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse59) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse57) 256) 0)) (not (<= (mod (+ .cse58 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse59 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse62 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse60 (mod (+ .cse62 .cse3) 256))) (let ((.cse61 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse60) 256))) (or (not (<= .cse60 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse61) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse60) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse60 0) (<= .cse61 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse62 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse64 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse63 (mod (+ .cse64 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse65 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse63) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse63 127)) (<= (mod (+ .cse64 .cse3) 256) 127) (= 0 .cse63) (not (<= (mod .cse64 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse63) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse65) 256) 0)) (<= .cse65 |c_ULTIMATE.start_main1_~y~0#1|) (= .cse64 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse67 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse66 (mod .cse67 256))) (let ((.cse68 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse66) 256))) (or (= .cse66 0) (not (<= (mod (+ .cse67 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse67 .cse3) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse68) 256) 0)) (not (<= .cse66 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse66) (<= .cse68 |c_ULTIMATE.start_main1_~y~0#1|)))))))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse69 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse71 (mod (+ .cse69 .cse3) 256))) (let ((.cse70 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse71)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse69 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse70 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse71 127) (<= (mod .cse69 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse70) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse71)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse74 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse73 (mod .cse74 256))) (let ((.cse72 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse73)) 256))) (or (<= .cse72 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse73) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse72) 256) 0)) (not (<= (mod (+ .cse74 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse74 .cse3) 256) 127) (<= .cse73 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse75 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse76 (mod (+ .cse75 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse77 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse76)) 256))) (or (not (<= (mod (+ .cse75 .cse3) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse75 256) 127) (<= .cse76 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse76) (<= .cse77 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse77) 256) 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse79 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse80 (mod .cse79 256))) (let ((.cse78 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse80)) 256))) (or (<= .cse78 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse79 .cse3) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse80) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse78) 256) 0)) (<= .cse80 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse79 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse83 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse82 (mod .cse83 256))) (let ((.cse81 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse82)) 256))) (or (<= .cse81 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse82) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse81) 256) 0)) (<= (mod (+ .cse83 .cse3) 256) 127) (<= .cse82 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse83 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse84 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse85 (mod (+ .cse84 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse86 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse85)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse84 .cse3) 256) 127) (<= (mod .cse84 256) 127) (<= .cse85 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse85) (<= .cse86 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse86) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse89 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse87 (mod (+ .cse89 .cse3) 256))) (let ((.cse88 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse87) 256))) (or (not (<= .cse87 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse88) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse87) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse89 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse87 0) (<= .cse88 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse89 256) 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse90 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse91 (mod .cse90 256))) (let ((.cse92 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse91) 256))) (or (not (<= (mod (+ .cse90 .cse3) 256) 127)) (= .cse91 0) (not (<= (mod (+ .cse90 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse92) 256) 0)) (not (<= .cse91 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse91) (<= .cse92 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse94 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse95 (mod .cse94 256))) (let ((.cse93 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse95)) 256))) (or (<= .cse93 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse94 .cse3) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse95) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse93) 256) 0)) (not (<= (mod (+ .cse94 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse95 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse96 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse97 (mod (+ .cse96 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse98 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse97) 256))) (or (not (<= (mod (+ .cse96 .cse3) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse97 127)) (<= (mod .cse96 256) 127) (= 0 .cse97) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse97) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse98) 256) 0)) (<= .cse98 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)))))) is different from true [2022-11-20 11:09:59,885 WARN L233 SmtUtils]: Spent 10.09s on a formula simplification. DAG size of input: 54 DAG size of output: 52 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:10:00,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:10:00,208 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-11-20 11:10:00,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 11:10:00,209 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 20 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 14 [2022-11-20 11:10:00,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:10:00,210 INFO L225 Difference]: With dead ends: 49 [2022-11-20 11:10:00,210 INFO L226 Difference]: Without dead ends: 39 [2022-11-20 11:10:00,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 204.0s TimeCoverageRelationStatistics Valid=79, Invalid=308, Unknown=9, NotChecked=156, Total=552 [2022-11-20 11:10:00,213 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:10:00,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 76 Unchecked, 0.0s Time] [2022-11-20 11:10:00,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-20 11:10:00,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-11-20 11:10:00,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 11:10:00,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-11-20 11:10:00,230 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 14 [2022-11-20 11:10:00,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:10:00,230 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-11-20 11:10:00,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 20 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) [2022-11-20 11:10:00,231 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-11-20 11:10:00,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:10:00,231 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:10:00,231 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:10:00,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-20 11:10:00,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:10:00,434 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:10:00,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:10:00,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1911673028, now seen corresponding path program 1 times [2022-11-20 11:10:00,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:10:00,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786566278] [2022-11-20 11:10:00,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:10:00,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:10:00,442 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:10:00,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [784433310] [2022-11-20 11:10:00,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:10:00,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:10:00,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:10:00,444 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:10:00,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:10:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:10:00,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-20 11:10:00,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:10:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:10:37,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:11:44,416 WARN L233 SmtUtils]: Spent 46.66s on a formula simplification. DAG size of input: 94 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:13:11,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 139 [2022-11-20 11:13:11,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:13:11,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786566278] [2022-11-20 11:13:11,585 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:13:11,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784433310] [2022-11-20 11:13:11,586 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-20 11:13:11,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:13:11,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:13:11,787 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_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:306) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 52 more [2022-11-20 11:13:11,790 INFO L158 Benchmark]: Toolchain (without parser) took 736821.85ms. Allocated memory is still 176.2MB. Free memory was 130.3MB in the beginning and 132.3MB in the end (delta: -2.0MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. [2022-11-20 11:13:11,791 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 132.1MB. Free memory was 74.3MB in the beginning and 74.2MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:13:11,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.37ms. Allocated memory is still 176.2MB. Free memory was 130.3MB in the beginning and 119.0MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 11:13:11,791 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.01ms. Allocated memory is still 176.2MB. Free memory was 118.5MB in the beginning and 116.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:13:11,792 INFO L158 Benchmark]: Boogie Preprocessor took 31.82ms. Allocated memory is still 176.2MB. Free memory was 116.9MB in the beginning and 115.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:13:11,792 INFO L158 Benchmark]: RCFGBuilder took 445.18ms. Allocated memory is still 176.2MB. Free memory was 115.3MB in the beginning and 103.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 11:13:11,792 INFO L158 Benchmark]: TraceAbstraction took 735942.26ms. Allocated memory is still 176.2MB. Free memory was 102.8MB in the beginning and 132.3MB in the end (delta: -29.5MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. [2022-11-20 11:13:11,796 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 132.1MB. Free memory was 74.3MB in the beginning and 74.2MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.37ms. Allocated memory is still 176.2MB. Free memory was 130.3MB in the beginning and 119.0MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.01ms. Allocated memory is still 176.2MB. Free memory was 118.5MB in the beginning and 116.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.82ms. Allocated memory is still 176.2MB. Free memory was 116.9MB in the beginning and 115.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 445.18ms. Allocated memory is still 176.2MB. Free memory was 115.3MB in the beginning and 103.3MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 735942.26ms. Allocated memory is still 176.2MB. Free memory was 102.8MB in the beginning and 132.3MB in the end (delta: -29.5MB). Peak memory consumption was 65.5MB. 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_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6c5808fcdfedd93e514ea4bc51242b78bf5dcc9e332c7faf3dfcc4d6de127e2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 11:13:14,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:13:14,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:13:14,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:13:14,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:13:14,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:13:14,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:13:14,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:13:14,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:13:14,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:13:14,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:13:14,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:13:14,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:13:14,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:13:14,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:13:14,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:13:14,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:13:14,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:13:14,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:13:14,206 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:13:14,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:13:14,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:13:14,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:13:14,217 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:13:14,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:13:14,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:13:14,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:13:14,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:13:14,223 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:13:14,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:13:14,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:13:14,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:13:14,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:13:14,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:13:14,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:13:14,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:13:14,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:13:14,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:13:14,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:13:14,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:13:14,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:13:14,245 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-20 11:13:14,290 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:13:14,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:13:14,292 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:13:14,292 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:13:14,293 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:13:14,293 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:13:14,294 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:13:14,294 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:13:14,294 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:13:14,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:13:14,296 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:13:14,296 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:13:14,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:13:14,296 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:13:14,297 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:13:14,297 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:13:14,297 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 11:13:14,297 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 11:13:14,297 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 11:13:14,298 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:13:14,298 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:13:14,298 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:13:14,298 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:13:14,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:13:14,299 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:13:14,299 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:13:14,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:13:14,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:13:14,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:13:14,300 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:13:14,300 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 11:13:14,301 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 11:13:14,301 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:13:14,301 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:13:14,301 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:13:14,302 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 11:13:14,302 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/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_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> f6c5808fcdfedd93e514ea4bc51242b78bf5dcc9e332c7faf3dfcc4d6de127e2 [2022-11-20 11:13:14,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:13:14,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:13:14,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:13:14,750 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:13:14,750 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:13:14,752 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/combinations/gcd_2+newton_2_3.i [2022-11-20 11:13:18,146 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:13:18,402 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:13:18,405 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/sv-benchmarks/c/combinations/gcd_2+newton_2_3.i [2022-11-20 11:13:18,421 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/data/4000af3f7/405ec4e60afe41e698b262f548c30c28/FLAG36095150a [2022-11-20 11:13:18,444 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/data/4000af3f7/405ec4e60afe41e698b262f548c30c28 [2022-11-20 11:13:18,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:13:18,449 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:13:18,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:13:18,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:13:18,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:13:18,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:13:18" (1/1) ... [2022-11-20 11:13:18,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d59af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:18, skipping insertion in model container [2022-11-20 11:13:18,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:13:18" (1/1) ... [2022-11-20 11:13:18,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:13:18,497 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:13:18,718 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/sv-benchmarks/c/combinations/gcd_2+newton_2_3.i[1226,1239] [2022-11-20 11:13:18,772 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/sv-benchmarks/c/combinations/gcd_2+newton_2_3.i[2841,2854] [2022-11-20 11:13:18,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:13:18,796 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:13:18,823 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/sv-benchmarks/c/combinations/gcd_2+newton_2_3.i[1226,1239] [2022-11-20 11:13:18,843 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/sv-benchmarks/c/combinations/gcd_2+newton_2_3.i[2841,2854] [2022-11-20 11:13:18,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:13:18,868 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:13:18,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:18 WrapperNode [2022-11-20 11:13:18,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:13:18,871 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:13:18,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:13:18,872 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:13:18,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:18" (1/1) ... [2022-11-20 11:13:18,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:18" (1/1) ... [2022-11-20 11:13:18,974 INFO L138 Inliner]: procedures = 28, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 80 [2022-11-20 11:13:18,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:13:18,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:13:18,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:13:18,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:13:18,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:18" (1/1) ... [2022-11-20 11:13:18,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:18" (1/1) ... [2022-11-20 11:13:19,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:18" (1/1) ... [2022-11-20 11:13:19,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:18" (1/1) ... [2022-11-20 11:13:19,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:18" (1/1) ... [2022-11-20 11:13:19,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:18" (1/1) ... [2022-11-20 11:13:19,030 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:18" (1/1) ... [2022-11-20 11:13:19,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:18" (1/1) ... [2022-11-20 11:13:19,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:13:19,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:13:19,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:13:19,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:13:19,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:18" (1/1) ... [2022-11-20 11:13:19,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:13:19,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:13:19,092 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:13:19,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:13:19,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:13:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 11:13:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-20 11:13:19,129 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-20 11:13:19,129 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-20 11:13:19,130 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-20 11:13:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:13:19,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:13:19,214 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:13:19,216 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:13:26,629 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:13:26,636 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:13:26,637 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 11:13:26,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:13:26 BoogieIcfgContainer [2022-11-20 11:13:26,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:13:26,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:13:26,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:13:26,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:13:26,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:13:18" (1/3) ... [2022-11-20 11:13:26,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5c164a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:13:26, skipping insertion in model container [2022-11-20 11:13:26,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:13:18" (2/3) ... [2022-11-20 11:13:26,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5c164a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:13:26, skipping insertion in model container [2022-11-20 11:13:26,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:13:26" (3/3) ... [2022-11-20 11:13:26,650 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_3.i [2022-11-20 11:13:26,671 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:13:26,672 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 11:13:26,727 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:13:26,735 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4d0cd1ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:13:26,735 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-20 11:13:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 11:13:26,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:13:26,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:13:26,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:13:26,749 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:13:26,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:13:26,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-11-20 11:13:26,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:13:26,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957166965] [2022-11-20 11:13:26,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:13:26,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:13:26,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:13:26,791 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 11:13:26,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-20 11:13:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:13:26,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 11:13:26,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:13:27,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:13:27,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:13:27,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:13:27,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957166965] [2022-11-20 11:13:27,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957166965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:13:27,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:13:27,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:13:27,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407052012] [2022-11-20 11:13:27,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:13:27,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:13:27,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:13:27,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:13:27,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:13:27,166 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:13:27,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:13:27,212 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2022-11-20 11:13:27,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:13:27,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 11:13:27,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:13:27,223 INFO L225 Difference]: With dead ends: 68 [2022-11-20 11:13:27,223 INFO L226 Difference]: Without dead ends: 30 [2022-11-20 11:13:27,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:13:27,233 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:13:27,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-11-20 11:13:27,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-20 11:13:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-20 11:13:27,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 11:13:27,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-20 11:13:27,286 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2022-11-20 11:13:27,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:13:27,287 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-20 11:13:27,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:13:27,288 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-20 11:13:27,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:13:27,290 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:13:27,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:13:27,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-20 11:13:27,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:13:27,505 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:13:27,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:13:27,506 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2022-11-20 11:13:27,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:13:27,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785641633] [2022-11-20 11:13:27,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:13:27,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:13:27,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:13:27,535 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 11:13:27,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-20 11:13:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:13:27,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 11:13:27,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:13:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:13:27,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:13:27,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:13:27,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785641633] [2022-11-20 11:13:27,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785641633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:13:27,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:13:27,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:13:27,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121889757] [2022-11-20 11:13:27,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:13:27,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:13:27,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:13:27,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:13:27,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:13:27,781 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:13:27,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:13:27,998 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-11-20 11:13:27,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:13:27,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 11:13:28,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:13:28,000 INFO L225 Difference]: With dead ends: 37 [2022-11-20 11:13:28,001 INFO L226 Difference]: Without dead ends: 31 [2022-11-20 11:13:28,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:13:28,002 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:13:28,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 84 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:13:28,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-20 11:13:28,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-11-20 11:13:28,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 11:13:28,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-20 11:13:28,011 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2022-11-20 11:13:28,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:13:28,012 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-20 11:13:28,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:13:28,012 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-20 11:13:28,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 11:13:28,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:13:28,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:13:28,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:13:28,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:13:28,227 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:13:28,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:13:28,228 INFO L85 PathProgramCache]: Analyzing trace with hash 149955676, now seen corresponding path program 1 times [2022-11-20 11:13:28,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:13:28,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184746277] [2022-11-20 11:13:28,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:13:28,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:13:28,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:13:28,234 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 11:13:28,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-20 11:13:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:13:28,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 11:13:28,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:13:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 11:13:28,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:13:28,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:13:28,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184746277] [2022-11-20 11:13:28,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184746277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:13:28,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:13:28,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:13:28,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870251798] [2022-11-20 11:13:28,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:13:28,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:13:28,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:13:28,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:13:28,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:13:28,505 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:13:28,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:13:28,638 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-11-20 11:13:28,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:13:28,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 11:13:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:13:28,641 INFO L225 Difference]: With dead ends: 38 [2022-11-20 11:13:28,641 INFO L226 Difference]: Without dead ends: 30 [2022-11-20 11:13:28,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:13:28,643 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:13:28,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 84 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:13:28,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-20 11:13:28,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-20 11:13:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 11:13:28,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-20 11:13:28,656 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 12 [2022-11-20 11:13:28,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:13:28,657 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-20 11:13:28,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:13:28,659 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-20 11:13:28,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 11:13:28,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:13:28,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:13:28,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 11:13:28,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:13:28,876 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:13:28,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:13:28,877 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2022-11-20 11:13:28,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:13:28,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805470210] [2022-11-20 11:13:28,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:13:28,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:13:28,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:13:28,880 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 11:13:28,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-20 11:13:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:13:28,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 11:13:28,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:13:29,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:13:29,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:13:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:13:30,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:13:30,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805470210] [2022-11-20 11:13:30,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805470210] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:13:30,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:13:30,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-20 11:13:30,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374461982] [2022-11-20 11:13:30,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:13:30,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 11:13:30,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:13:30,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 11:13:30,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:13:30,493 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:13:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:13:33,086 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-11-20 11:13:33,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 11:13:33,087 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 11:13:33,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:13:33,088 INFO L225 Difference]: With dead ends: 47 [2022-11-20 11:13:33,088 INFO L226 Difference]: Without dead ends: 33 [2022-11-20 11:13:33,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2022-11-20 11:13:33,090 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:13:33,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 224 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-20 11:13:33,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-20 11:13:33,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-20 11:13:33,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-20 11:13:33,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-11-20 11:13:33,098 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 12 [2022-11-20 11:13:33,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:13:33,099 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-11-20 11:13:33,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:13:33,099 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-11-20 11:13:33,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 11:13:33,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:13:33,100 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:13:33,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:13:33,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:13:33,315 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:13:33,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:13:33,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2084161321, now seen corresponding path program 2 times [2022-11-20 11:13:33,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:13:33,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453768821] [2022-11-20 11:13:33,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:13:33,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:13:33,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:13:33,319 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 11:13:33,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52663710-e42d-405f-9693-e3aa61e7a759/bin/uautomizer-ug76WZFUDN/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)] Waiting until timeout for monitored process [2022-11-20 11:13:39,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:13:39,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:13:39,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-20 11:13:39,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:14:27,115 WARN L233 SmtUtils]: Spent 5.36s on a formula simplification. DAG size of input: 21 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 11:14:29,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:14:29,709 INFO L328 TraceCheckSpWp]: Computing backward predicates...