./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_1+newton_3_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_1+newton_3_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R --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 bf18a45b9b9a30137533b9517bddb2c27979a6060c07746e0407bf72765a3792 --- 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-38b53e6 [2022-11-25 16:52:07,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:52:07,777 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:52:07,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:52:07,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:52:07,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:52:07,824 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:52:07,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:52:07,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:52:07,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:52:07,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:52:07,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:52:07,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:52:07,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:52:07,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:52:07,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:52:07,842 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:52:07,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:52:07,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:52:07,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:52:07,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:52:07,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:52:07,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:52:07,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:52:07,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:52:07,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:52:07,877 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:52:07,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:52:07,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:52:07,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:52:07,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:52:07,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:52:07,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:52:07,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:52:07,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:52:07,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:52:07,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:52:07,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:52:07,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:52:07,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:52:07,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:52:07,890 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 16:52:07,933 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:52:07,934 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:52:07,934 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:52:07,935 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:52:07,936 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:52:07,936 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:52:07,937 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:52:07,937 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:52:07,938 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:52:07,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:52:07,939 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:52:07,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:52:07,940 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:52:07,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:52:07,940 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:52:07,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:52:07,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:52:07,941 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:52:07,941 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:52:07,941 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:52:07,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:52:07,942 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:52:07,942 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:52:07,942 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:52:07,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:52:07,943 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:52:07,943 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:52:07,943 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:52:07,944 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:52:07,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:52:07,945 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:52:07,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:52:07,945 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:52:07,946 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:52:07,946 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/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_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R 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 -> bf18a45b9b9a30137533b9517bddb2c27979a6060c07746e0407bf72765a3792 [2022-11-25 16:52:08,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:52:08,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:52:08,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:52:08,298 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:52:08,299 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:52:08,300 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/combinations/gcd_1+newton_3_3.i [2022-11-25 16:52:11,315 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:52:11,572 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:52:11,572 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/sv-benchmarks/c/combinations/gcd_1+newton_3_3.i [2022-11-25 16:52:11,579 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/data/b3fcab948/67f108420724497cb58f20fb2cd94a5c/FLAG5a1c65034 [2022-11-25 16:52:11,594 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/data/b3fcab948/67f108420724497cb58f20fb2cd94a5c [2022-11-25 16:52:11,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:52:11,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:52:11,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:52:11,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:52:11,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:52:11,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:52:11" (1/1) ... [2022-11-25 16:52:11,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@333da854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:52:11, skipping insertion in model container [2022-11-25 16:52:11,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:52:11" (1/1) ... [2022-11-25 16:52:11,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:52:11,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:52:11,788 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_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/sv-benchmarks/c/combinations/gcd_1+newton_3_3.i[1226,1239] [2022-11-25 16:52:11,812 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_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/sv-benchmarks/c/combinations/gcd_1+newton_3_3.i[2828,2841] [2022-11-25 16:52:11,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:52:11,825 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:52:11,838 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_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/sv-benchmarks/c/combinations/gcd_1+newton_3_3.i[1226,1239] [2022-11-25 16:52:11,853 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_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/sv-benchmarks/c/combinations/gcd_1+newton_3_3.i[2828,2841] [2022-11-25 16:52:11,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:52:11,869 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:52:11,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:52:11 WrapperNode [2022-11-25 16:52:11,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:52:11,871 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:52:11,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:52:11,871 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:52:11,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:52:11" (1/1) ... [2022-11-25 16:52:11,906 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:52:11" (1/1) ... [2022-11-25 16:52:11,943 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 90 [2022-11-25 16:52:11,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:52:11,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:52:11,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:52:11,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:52:11,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:52:11" (1/1) ... [2022-11-25 16:52:11,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:52:11" (1/1) ... [2022-11-25 16:52:11,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:52:11" (1/1) ... [2022-11-25 16:52:11,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:52:11" (1/1) ... [2022-11-25 16:52:11,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:52:11" (1/1) ... [2022-11-25 16:52:11,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:52:11" (1/1) ... [2022-11-25 16:52:11,992 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:52:11" (1/1) ... [2022-11-25 16:52:12,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:52:11" (1/1) ... [2022-11-25 16:52:12,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:52:12,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:52:12,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:52:12,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:52:12,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:52:11" (1/1) ... [2022-11-25 16:52:12,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:52:12,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:52:12,050 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:52:12,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:52:12,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:52:12,096 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-25 16:52:12,096 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-25 16:52:12,097 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-25 16:52:12,098 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-25 16:52:12,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:52:12,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:52:12,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:52:12,190 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:52:12,193 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:52:12,503 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:52:12,511 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:52:12,511 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 16:52:12,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:52:12 BoogieIcfgContainer [2022-11-25 16:52:12,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:52:12,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:52:12,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:52:12,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:52:12,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:52:11" (1/3) ... [2022-11-25 16:52:12,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a585a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:52:12, skipping insertion in model container [2022-11-25 16:52:12,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:52:11" (2/3) ... [2022-11-25 16:52:12,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a585a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:52:12, skipping insertion in model container [2022-11-25 16:52:12,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:52:12" (3/3) ... [2022-11-25 16:52:12,542 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_3_3.i [2022-11-25 16:52:12,575 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:52:12,575 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 16:52:12,658 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:52:12,669 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;@3aca1696, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:52:12,670 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-25 16:52:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 16:52:12,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 16:52:12,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:52:12,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:52:12,686 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:52:12,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:52:12,694 INFO L85 PathProgramCache]: Analyzing trace with hash -247750664, now seen corresponding path program 1 times [2022-11-25 16:52:12,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:52:12,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772086620] [2022-11-25 16:52:12,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:52:12,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:52:12,839 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:52:12,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1783272734] [2022-11-25 16:52:12,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:52:12,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:52:12,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:52:12,848 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:52:12,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 16:52:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:12,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 16:52:12,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:52:12,981 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-25 16:52:12,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:52:12,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:52:12,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772086620] [2022-11-25 16:52:12,985 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:52:12,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783272734] [2022-11-25 16:52:12,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783272734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:52:12,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:52:12,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:52:12,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7355152] [2022-11-25 16:52:12,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:52:12,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 16:52:12,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:52:13,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 16:52:13,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 16:52:13,028 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-25 16:52:13,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:52:13,072 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2022-11-25 16:52:13,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 16:52:13,074 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-25 16:52:13,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:52:13,082 INFO L225 Difference]: With dead ends: 72 [2022-11-25 16:52:13,082 INFO L226 Difference]: Without dead ends: 32 [2022-11-25 16:52:13,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 16:52:13,092 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:52:13,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:52:13,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-25 16:52:13,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-25 16:52:13,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 16:52:13,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-11-25 16:52:13,139 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2022-11-25 16:52:13,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:52:13,140 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-11-25 16:52:13,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-25 16:52:13,140 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-11-25 16:52:13,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 16:52:13,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:52:13,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:52:13,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 16:52:13,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:52:13,349 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:52:13,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:52:13,350 INFO L85 PathProgramCache]: Analyzing trace with hash -251444748, now seen corresponding path program 1 times [2022-11-25 16:52:13,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:52:13,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194944923] [2022-11-25 16:52:13,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:52:13,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:52:13,376 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:52:13,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [662394273] [2022-11-25 16:52:13,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:52:13,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:52:13,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:52:13,379 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:52:13,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 16:52:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:13,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 16:52:13,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:52:13,499 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-25 16:52:13,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:52:13,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:52:13,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194944923] [2022-11-25 16:52:13,500 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:52:13,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662394273] [2022-11-25 16:52:13,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662394273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:52:13,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:52:13,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:52:13,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889738154] [2022-11-25 16:52:13,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:52:13,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:52:13,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:52:13,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:52:13,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:52:13,503 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. 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-25 16:52:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:52:13,519 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-11-25 16:52:13,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:52:13,520 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-25 16:52:13,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:52:13,521 INFO L225 Difference]: With dead ends: 39 [2022-11-25 16:52:13,521 INFO L226 Difference]: Without dead ends: 33 [2022-11-25 16:52:13,521 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-25 16:52:13,523 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:52:13,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:52:13,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-25 16:52:13,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-25 16:52:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 16:52:13,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-11-25 16:52:13,530 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2022-11-25 16:52:13,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:52:13,530 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-11-25 16:52:13,543 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-25 16:52:13,543 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-11-25 16:52:13,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 16:52:13,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:52:13,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:52:13,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-25 16:52:13,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:52:13,753 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:52:13,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:52:13,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1673157840, now seen corresponding path program 1 times [2022-11-25 16:52:13,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:52:13,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036388503] [2022-11-25 16:52:13,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:52:13,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:52:13,772 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:52:13,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [732513696] [2022-11-25 16:52:13,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:52:13,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:52:13,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:52:13,789 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:52:13,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 16:52:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:52:13,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 16:52:13,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:52:13,912 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-25 16:52:13,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:52:13,946 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-25 16:52:13,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:52:13,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036388503] [2022-11-25 16:52:13,947 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 16:52:13,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732513696] [2022-11-25 16:52:13,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732513696] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:52:13,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:52:13,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-11-25 16:52:13,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433988315] [2022-11-25 16:52:13,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 16:52:13,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:52:13,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:52:13,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:52:13,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:52:13,950 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-25 16:52:14,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:52:14,023 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-11-25 16:52:14,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:52:14,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-25 16:52:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:52:14,025 INFO L225 Difference]: With dead ends: 39 [2022-11-25 16:52:14,025 INFO L226 Difference]: Without dead ends: 34 [2022-11-25 16:52:14,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:52:14,027 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:52:14,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 185 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:52:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-25 16:52:14,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-25 16:52:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 16:52:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-11-25 16:52:14,035 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2022-11-25 16:52:14,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:52:14,036 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-11-25 16:52:14,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-25 16:52:14,036 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-11-25 16:52:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 16:52:14,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:52:14,038 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:52:14,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 16:52:14,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-25 16:52:14,244 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 16:52:14,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:52:14,245 INFO L85 PathProgramCache]: Analyzing trace with hash -276630798, now seen corresponding path program 2 times [2022-11-25 16:52:14,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:52:14,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682530293] [2022-11-25 16:52:14,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:52:14,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:52:14,259 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 16:52:14,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [449744806] [2022-11-25 16:52:14,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:52:14,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:52:14,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:52:14,260 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:52:14,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 16:52:24,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 16:52:24,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:52:24,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-25 16:52:24,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:54:49,890 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (and (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse0) 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse0) (not (= .cse0 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) is different from false [2022-11-25 16:55:12,075 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (and (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse0) 256) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse0) (not (= .cse0 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) is different from false [2022-11-25 16:55:32,470 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (and (= .cse0 |c_ULTIMATE.start_gcd_test_#res#1|) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse0) 256) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (not (= .cse0 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) is different from false [2022-11-25 16:55:50,983 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (and (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse0) 256) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (not (= .cse0 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) is different from false [2022-11-25 16:55:52,986 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (and (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse0) 256) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (not (= .cse0 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) is different from true [2022-11-25 16:56:09,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 16:56:09,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:57:06,471 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse27 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse28 (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse29 (mod (+ .cse27 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse9 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse13 (<= .cse29 127)) (.cse23 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0))) (.cse8 (not .cse18)) (.cse25 (= .cse28 0)) (.cse2 (<= .cse28 127)) (.cse17 (mod .cse27 256))) (let ((.cse19 (<= .cse17 127)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse29)) 256) 0))) (.cse3 (not .cse2)) (.cse15 (or .cse23 .cse8 .cse25)) (.cse6 (= .cse29 0)) (.cse7 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse29) 256) 0))) (.cse10 (not .cse13)) (.cse14 (not .cse9)) (.cse16 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0)))) (and (or (let ((.cse5 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse17)) 256) 0)) .cse18))) (let ((.cse1 (or .cse14 (and (or .cse16 .cse8) .cse5))) (.cse4 (or .cse14 (and .cse5 .cse15)))) (and (or (let ((.cse0 (or (and .cse5 (or .cse6 .cse7 .cse8)) .cse9))) (and (or (and .cse0 .cse1) .cse2) (or .cse3 (and .cse4 .cse0)))) .cse10) (or (let ((.cse11 (or .cse9 (and (or .cse12 .cse8) .cse5)))) (and (or (and .cse1 .cse11) .cse2) (or (and .cse4 .cse11) .cse3))) .cse13)))) .cse19) (or (not .cse19) (let ((.cse22 (or .cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse17) 256) 0)) (= .cse17 0))) (.cse24 (= .cse27 0))) (let ((.cse21 (or .cse14 (and .cse22 (or .cse24 .cse16 .cse8))))) (and (or (let ((.cse20 (or (and (or .cse24 .cse12 .cse8) .cse22) .cse9))) (and (or .cse2 (and .cse20 .cse21)) (or (and (or .cse14 (and .cse22 (or .cse23 .cse24 .cse8 .cse25))) .cse20) .cse3))) .cse13) (or (let ((.cse26 (or .cse9 (and .cse22 (or .cse24 .cse6 .cse7 .cse8))))) (and (or .cse3 (and (or .cse14 (and .cse22 .cse15)) .cse26)) (or (and .cse26 .cse21) .cse2))) .cse10)))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2022-11-25 16:58:40,552 WARN L233 SmtUtils]: Spent 1.06m on a formula simplification. DAG size of input: 67 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:00:16,188 WARN L233 SmtUtils]: Spent 32.70s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:01:03,674 WARN L859 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main1_~y~0#1_6| Int) (|v_ULTIMATE.start_main1_~x~0#1_5| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_main1_~x~0#1_5|) 256) |v_ULTIMATE.start_main1_~y~0#1_6|) 256))) (or (= .cse0 0) (not (= 0 (mod |v_ULTIMATE.start_main1_~x~0#1_5| |v_ULTIMATE.start_main1_~y~0#1_6|))) (<= 0 |v_ULTIMATE.start_main1_~x~0#1_5|) (not (= (mod (mod |v_ULTIMATE.start_main1_~y~0#1_6| .cse0) 256) 0)) (< (+ 128 |v_ULTIMATE.start_main1_~x~0#1_5|) 0) (<= |v_ULTIMATE.start_main1_~y~0#1_6| 0)))) is different from true [2022-11-25 17:01:04,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 17:01:04,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:01:04,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682530293] [2022-11-25 17:01:04,996 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:01:04,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449744806] [2022-11-25 17:01:04,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449744806] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:01:04,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:01:04,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2022-11-25 17:01:04,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426111962] [2022-11-25 17:01:04,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:01:04,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 17:01:04,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:01:04,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 17:01:04,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=115, Unknown=25, NotChecked=162, Total=342 [2022-11-25 17:01:04,999 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 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-25 17:01:59,105 WARN L233 SmtUtils]: Spent 50.27s on a formula simplification. DAG size of input: 45 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:02:01,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2022-11-25 17:04:02,109 WARN L233 SmtUtils]: Spent 1.78m on a formula simplification. DAG size of input: 84 DAG size of output: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:04:04,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-25 17:04:06,560 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse14 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse15 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse3 (not .cse9)) (.cse16 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or (let ((.cse12 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse13 (mod (+ .cse12 .cse14) 256))) (let ((.cse1 (<= .cse13 127)) (.cse8 (mod .cse12 256))) (let ((.cse0 (<= .cse8 127)) (.cse2 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse13)) 256) 0))) (.cse5 (= .cse13 0)) (.cse6 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse13) 256) 0))) (.cse7 (not .cse1))) (and (or .cse0 (let ((.cse4 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse8)) 256) 0)) .cse9))) (and (or .cse1 (and (or .cse2 .cse3) .cse4)) (or (and .cse4 (or .cse5 .cse6 .cse3)) .cse7)))) (or (not .cse0) (let ((.cse11 (or .cse9 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse8) 256) 0)) (= .cse8 0))) (.cse10 (= .cse12 0))) (and (or (and (or .cse10 .cse2 .cse3) .cse11) .cse1) (or (and .cse11 (or .cse10 .cse5 .cse6 .cse3)) .cse7))))))))) .cse15 .cse16) (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (let ((.cse19 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse17 (<= .cse19 127))) (and (let ((.cse18 (mod (mod .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse17) (= 0 .cse18) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse18) 256) 0)))) (let ((.cse20 (mod (+ .cse19 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse20 .cse14) 256))) 256) 0)) .cse17 (= .cse20 0)))))) .cse15 .cse3 .cse16) (< 0 |c_ULTIMATE.start_gcd_test_~b#1|) (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse23 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse22 (<= .cse23 127))) (and (let ((.cse21 (mod (+ .cse23 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse21 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) .cse22 (= .cse21 0))) (let ((.cse24 (mod (mod .cse23 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (not .cse22) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse24) 256) 0)) (= .cse24 0)))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse25 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (<= .cse25 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse25) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse26 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (not (<= .cse26 127)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse26) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))))))) is different from false [2022-11-25 17:04:08,565 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse14 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse15 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse3 (not .cse9)) (.cse16 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or (let ((.cse12 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse13 (mod (+ .cse12 .cse14) 256))) (let ((.cse1 (<= .cse13 127)) (.cse8 (mod .cse12 256))) (let ((.cse0 (<= .cse8 127)) (.cse2 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse13)) 256) 0))) (.cse5 (= .cse13 0)) (.cse6 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse13) 256) 0))) (.cse7 (not .cse1))) (and (or .cse0 (let ((.cse4 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse8)) 256) 0)) .cse9))) (and (or .cse1 (and (or .cse2 .cse3) .cse4)) (or (and .cse4 (or .cse5 .cse6 .cse3)) .cse7)))) (or (not .cse0) (let ((.cse11 (or .cse9 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse8) 256) 0)) (= .cse8 0))) (.cse10 (= .cse12 0))) (and (or (and (or .cse10 .cse2 .cse3) .cse11) .cse1) (or (and .cse11 (or .cse10 .cse5 .cse6 .cse3)) .cse7))))))))) .cse15 .cse16) (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (let ((.cse19 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse17 (<= .cse19 127))) (and (let ((.cse18 (mod (mod .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse17) (= 0 .cse18) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse18) 256) 0)))) (let ((.cse20 (mod (+ .cse19 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse20 .cse14) 256))) 256) 0)) .cse17 (= .cse20 0)))))) .cse15 .cse3 .cse16) (< 0 |c_ULTIMATE.start_gcd_test_~b#1|) (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse23 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse22 (<= .cse23 127))) (and (let ((.cse21 (mod (+ .cse23 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse21 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) .cse22 (= .cse21 0))) (let ((.cse24 (mod (mod .cse23 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (not .cse22) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse24) 256) 0)) (= .cse24 0)))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse25 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (<= .cse25 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse25) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse26 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (not (<= .cse26 127)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse26) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))))))) is different from true [2022-11-25 17:04:10,675 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (or (let ((.cse27 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse28 (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse29 (mod (+ .cse27 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse9 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse13 (<= .cse29 127)) (.cse23 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0))) (.cse8 (not .cse18)) (.cse25 (= .cse28 0)) (.cse2 (<= .cse28 127)) (.cse17 (mod .cse27 256))) (let ((.cse19 (<= .cse17 127)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse29)) 256) 0))) (.cse3 (not .cse2)) (.cse15 (or .cse23 .cse8 .cse25)) (.cse6 (= .cse29 0)) (.cse7 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse29) 256) 0))) (.cse10 (not .cse13)) (.cse14 (not .cse9)) (.cse16 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0)))) (and (or (let ((.cse5 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse17)) 256) 0)) .cse18))) (let ((.cse1 (or .cse14 (and (or .cse16 .cse8) .cse5))) (.cse4 (or .cse14 (and .cse5 .cse15)))) (and (or (let ((.cse0 (or (and .cse5 (or .cse6 .cse7 .cse8)) .cse9))) (and (or (and .cse0 .cse1) .cse2) (or .cse3 (and .cse4 .cse0)))) .cse10) (or (let ((.cse11 (or .cse9 (and (or .cse12 .cse8) .cse5)))) (and (or (and .cse1 .cse11) .cse2) (or (and .cse4 .cse11) .cse3))) .cse13)))) .cse19) (or (not .cse19) (let ((.cse22 (or .cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse17) 256) 0)) (= .cse17 0))) (.cse24 (= .cse27 0))) (let ((.cse21 (or .cse14 (and .cse22 (or .cse24 .cse16 .cse8))))) (and (or (let ((.cse20 (or (and (or .cse24 .cse12 .cse8) .cse22) .cse9))) (and (or .cse2 (and .cse20 .cse21)) (or (and (or .cse14 (and .cse22 (or .cse23 .cse24 .cse8 .cse25))) .cse20) .cse3))) .cse13) (or (let ((.cse26 (or .cse9 (and .cse22 (or .cse24 .cse6 .cse7 .cse8))))) (and (or .cse3 (and (or .cse14 (and .cse22 .cse15)) .cse26)) (or (and .cse26 .cse21) .cse2))) .cse10)))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (< 0 |c_ULTIMATE.start_gcd_test_~b#1|) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse30 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (<= .cse30 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse30) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse31 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (not (<= .cse31 127)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse31) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))))) is different from false [2022-11-25 17:04:14,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2022-11-25 17:04:16,119 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse19 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse29 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (= .cse29 0)) (.cse30 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse10 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse9 (not .cse19)) (.cse31 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) .cse0 (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (or (let ((.cse27 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse28 (mod (+ .cse29 .cse30) 256))) (let ((.cse14 (<= .cse28 127)) (.cse24 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 0))) (.cse25 (= .cse27 0)) (.cse3 (<= .cse27 127)) (.cse18 (mod .cse29 256))) (let ((.cse20 (<= .cse18 127)) (.cse13 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0))) (.cse4 (not .cse3)) (.cse16 (or .cse24 .cse9 .cse25)) (.cse7 (= .cse28 0)) (.cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0))) (.cse11 (not .cse14)) (.cse15 (not .cse10)) (.cse17 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse27)) 256) 0)))) (and (or (let ((.cse6 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse18)) 256) 0)) .cse19))) (let ((.cse2 (or .cse15 (and (or .cse17 .cse9) .cse6))) (.cse5 (or .cse15 (and .cse6 .cse16)))) (and (or (let ((.cse1 (or (and .cse6 (or .cse7 .cse8 .cse9)) .cse10))) (and (or (and .cse1 .cse2) .cse3) (or .cse4 (and .cse5 .cse1)))) .cse11) (or (let ((.cse12 (or .cse10 (and (or .cse13 .cse9) .cse6)))) (and (or (and .cse2 .cse12) .cse3) (or (and .cse5 .cse12) .cse4))) .cse14)))) .cse20) (or (not .cse20) (let ((.cse23 (or .cse19 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse18) 256) 0)) (= .cse18 0)))) (let ((.cse22 (or .cse15 (and .cse23 (or .cse0 .cse17 .cse9))))) (and (or (let ((.cse21 (or (and (or .cse0 .cse13 .cse9) .cse23) .cse10))) (and (or .cse3 (and .cse21 .cse22)) (or (and (or .cse15 (and .cse23 (or .cse24 .cse0 .cse9 .cse25))) .cse21) .cse4))) .cse14) (or (let ((.cse26 (or .cse10 (and .cse23 (or .cse0 .cse7 .cse8 .cse9))))) (and (or .cse4 (and (or .cse15 (and .cse23 .cse16)) .cse26)) (or (and .cse26 .cse22) .cse3))) .cse11))))))))) .cse31) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (let ((.cse34 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse32 (<= .cse34 127))) (and (let ((.cse33 (mod (mod .cse34 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse32) (= 0 .cse33) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse33) 256) 0)))) (let ((.cse35 (mod (+ .cse34 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse35 .cse30) 256))) 256) 0)) .cse32 (= .cse35 0)))))) .cse10 .cse9 .cse31) (< 0 |c_ULTIMATE.start_gcd_test_~b#1|) (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse38 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse37 (<= .cse38 127))) (and (let ((.cse36 (mod (+ .cse38 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse36 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) .cse37 (= .cse36 0))) (let ((.cse39 (mod (mod .cse38 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (not .cse37) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse39) 256) 0)) (= .cse39 0)))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))))) is different from false [2022-11-25 17:04:18,124 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse19 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse29 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (= .cse29 0)) (.cse30 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse10 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse9 (not .cse19)) (.cse31 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) .cse0 (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (or (let ((.cse27 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse28 (mod (+ .cse29 .cse30) 256))) (let ((.cse14 (<= .cse28 127)) (.cse24 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 0))) (.cse25 (= .cse27 0)) (.cse3 (<= .cse27 127)) (.cse18 (mod .cse29 256))) (let ((.cse20 (<= .cse18 127)) (.cse13 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0))) (.cse4 (not .cse3)) (.cse16 (or .cse24 .cse9 .cse25)) (.cse7 (= .cse28 0)) (.cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0))) (.cse11 (not .cse14)) (.cse15 (not .cse10)) (.cse17 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse27)) 256) 0)))) (and (or (let ((.cse6 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse18)) 256) 0)) .cse19))) (let ((.cse2 (or .cse15 (and (or .cse17 .cse9) .cse6))) (.cse5 (or .cse15 (and .cse6 .cse16)))) (and (or (let ((.cse1 (or (and .cse6 (or .cse7 .cse8 .cse9)) .cse10))) (and (or (and .cse1 .cse2) .cse3) (or .cse4 (and .cse5 .cse1)))) .cse11) (or (let ((.cse12 (or .cse10 (and (or .cse13 .cse9) .cse6)))) (and (or (and .cse2 .cse12) .cse3) (or (and .cse5 .cse12) .cse4))) .cse14)))) .cse20) (or (not .cse20) (let ((.cse23 (or .cse19 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse18) 256) 0)) (= .cse18 0)))) (let ((.cse22 (or .cse15 (and .cse23 (or .cse0 .cse17 .cse9))))) (and (or (let ((.cse21 (or (and (or .cse0 .cse13 .cse9) .cse23) .cse10))) (and (or .cse3 (and .cse21 .cse22)) (or (and (or .cse15 (and .cse23 (or .cse24 .cse0 .cse9 .cse25))) .cse21) .cse4))) .cse14) (or (let ((.cse26 (or .cse10 (and .cse23 (or .cse0 .cse7 .cse8 .cse9))))) (and (or .cse4 (and (or .cse15 (and .cse23 .cse16)) .cse26)) (or (and .cse26 .cse22) .cse3))) .cse11))))))))) .cse31) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (let ((.cse34 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse32 (<= .cse34 127))) (and (let ((.cse33 (mod (mod .cse34 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse32) (= 0 .cse33) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse33) 256) 0)))) (let ((.cse35 (mod (+ .cse34 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse35 .cse30) 256))) 256) 0)) .cse32 (= .cse35 0)))))) .cse10 .cse9 .cse31) (< 0 |c_ULTIMATE.start_gcd_test_~b#1|) (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse38 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse37 (<= .cse38 127))) (and (let ((.cse36 (mod (+ .cse38 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse36 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) .cse37 (= .cse36 0))) (let ((.cse39 (mod (mod .cse38 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (not .cse37) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse39) 256) 0)) (= .cse39 0)))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))))) is different from true [2022-11-25 17:04:44,207 WARN L233 SmtUtils]: Spent 17.45s on a formula simplification. DAG size of input: 34 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:04:46,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2022-11-25 17:04:48,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2022-11-25 17:04:50,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2022-11-25 17:04:52,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2022-11-25 17:04:54,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2022-11-25 17:04:56,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2022-11-25 17:04:58,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2022-11-25 17:05:00,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2022-11-25 17:05:02,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2022-11-25 17:05:04,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2022-11-25 17:05:06,258 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or (not .cse0) (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse1 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (and (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse1) 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse1) (not (= .cse1 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) (or (let ((.cse4 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse2 (<= .cse4 127))) (and (let ((.cse3 (mod (mod .cse4 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse2) (= 0 .cse3) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse3) 256) 0)))) (let ((.cse5 (mod (+ .cse4 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse5 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) 256) 0)) .cse2 (= .cse5 0)))))) (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) .cse0))) is different from false [2022-11-25 17:05:09,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-25 17:05:11,714 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse11 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse10 (mod .cse14 256))) (let ((.cse0 (= .cse10 0)) (.cse16 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse17 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse5 (not .cse11)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 128))) (not .cse0) (not (<= |c_ULTIMATE.start_gcd_test_~b#1| 127)) .cse1) (or (let ((.cse15 (mod (+ .cse14 .cse16) 256))) (let ((.cse3 (<= .cse15 127))) (let ((.cse2 (<= .cse10 127)) (.cse4 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse15)) 256) 0))) (.cse7 (= .cse15 0)) (.cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse15) 256) 0))) (.cse9 (not .cse3))) (and (or .cse2 (let ((.cse6 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse10)) 256) 0)) .cse11))) (and (or .cse3 (and (or .cse4 .cse5) .cse6)) (or (and .cse6 (or .cse7 .cse8 .cse5)) .cse9)))) (or (not .cse2) (let ((.cse13 (or .cse11 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse10) 256) 0)) .cse0)) (.cse12 (= .cse14 0))) (and (or (and (or .cse12 .cse4 .cse5) .cse13) .cse3) (or (and .cse13 (or .cse12 .cse7 .cse8 .cse5)) .cse9)))))))) .cse17 .cse1) (or (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)))) (or (let ((.cse20 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse18 (<= .cse20 127))) (and (let ((.cse19 (mod (mod .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse18) (= 0 .cse19) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0)))) (let ((.cse21 (mod (+ .cse20 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse21 .cse16) 256))) 256) 0)) .cse18 (= .cse21 0)))))) .cse17 .cse5 .cse1))))) is different from false [2022-11-25 17:05:13,721 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse14 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse11 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse10 (mod .cse14 256))) (let ((.cse0 (= .cse10 0)) (.cse16 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse17 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse5 (not .cse11)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 128))) (not .cse0) (not (<= |c_ULTIMATE.start_gcd_test_~b#1| 127)) .cse1) (or (let ((.cse15 (mod (+ .cse14 .cse16) 256))) (let ((.cse3 (<= .cse15 127))) (let ((.cse2 (<= .cse10 127)) (.cse4 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse15)) 256) 0))) (.cse7 (= .cse15 0)) (.cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse15) 256) 0))) (.cse9 (not .cse3))) (and (or .cse2 (let ((.cse6 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse10)) 256) 0)) .cse11))) (and (or .cse3 (and (or .cse4 .cse5) .cse6)) (or (and .cse6 (or .cse7 .cse8 .cse5)) .cse9)))) (or (not .cse2) (let ((.cse13 (or .cse11 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse10) 256) 0)) .cse0)) (.cse12 (= .cse14 0))) (and (or (and (or .cse12 .cse4 .cse5) .cse13) .cse3) (or (and .cse13 (or .cse12 .cse7 .cse8 .cse5)) .cse9)))))))) .cse17 .cse1) (or (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)))) (or (let ((.cse20 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse18 (<= .cse20 127))) (and (let ((.cse19 (mod (mod .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse18) (= 0 .cse19) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0)))) (let ((.cse21 (mod (+ .cse20 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse21 .cse16) 256))) 256) 0)) .cse18 (= .cse21 0)))))) .cse17 .cse5 .cse1))))) is different from true [2022-11-25 17:05:15,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-25 17:05:18,966 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse14 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse11 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse10 (mod .cse14 256))) (let ((.cse0 (= .cse10 0)) (.cse16 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse17 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse5 (not .cse11)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 128))) (not .cse0) (not (<= |c_ULTIMATE.start_gcd_test_~b#1| 127)) .cse1) (or (let ((.cse15 (mod (+ .cse14 .cse16) 256))) (let ((.cse3 (<= .cse15 127))) (let ((.cse2 (<= .cse10 127)) (.cse4 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse15)) 256) 0))) (.cse7 (= .cse15 0)) (.cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse15) 256) 0))) (.cse9 (not .cse3))) (and (or .cse2 (let ((.cse6 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse10)) 256) 0)) .cse11))) (and (or .cse3 (and (or .cse4 .cse5) .cse6)) (or (and .cse6 (or .cse7 .cse8 .cse5)) .cse9)))) (or (not .cse2) (let ((.cse13 (or .cse11 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse10) 256) 0)) .cse0)) (.cse12 (= .cse14 0))) (and (or (and (or .cse12 .cse4 .cse5) .cse13) .cse3) (or (and .cse13 (or .cse12 .cse7 .cse8 .cse5)) .cse9)))))))) .cse17 .cse1) (or (let ((.cse20 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse18 (<= .cse20 127))) (and (let ((.cse19 (mod (mod .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse18) (= 0 .cse19) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0)))) (let ((.cse21 (mod (+ .cse20 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse21 .cse16) 256))) 256) 0)) .cse18 (= .cse21 0)))))) .cse17 .cse5 .cse1))))) is different from true [2022-11-25 17:05:20,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-25 17:05:20,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:05:20,977 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-11-25 17:05:20,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 17:05:20,984 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 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 13 [2022-11-25 17:05:20,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:05:20,985 INFO L225 Difference]: With dead ends: 46 [2022-11-25 17:05:20,985 INFO L226 Difference]: Without dead ends: 39 [2022-11-25 17:05:20,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 395.4s TimeCoverageRelationStatistics Valid=69, Invalid=176, Unknown=43, NotChecked=468, Total=756 [2022-11-25 17:05:20,986 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 8 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 34.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:05:20,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 422 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 53 Invalid, 15 Unknown, 172 Unchecked, 34.6s Time] [2022-11-25 17:05:20,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-25 17:05:20,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-11-25 17:05:20,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 17:05:20,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-11-25 17:05:20,998 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 13 [2022-11-25 17:05:20,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:05:20,998 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-11-25 17:05:20,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 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-25 17:05:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-11-25 17:05:20,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 17:05:20,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:05:20,999 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:05:21,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-25 17:05:21,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:21,200 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:05:21,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:05:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash 66034544, now seen corresponding path program 3 times [2022-11-25 17:05:21,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:05:21,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468862309] [2022-11-25 17:05:21,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:05:21,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:05:21,212 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:05:21,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1150545182] [2022-11-25 17:05:21,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:05:21,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:05:21,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:05:21,214 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:05:21,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03cbd0d4-27cf-4591-b606-6dd7f477d4c4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:05:37,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 17:05:37,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:05:37,282 WARN L261 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-25 17:05:37,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:06:20,292 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_19|) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_19|)) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse0) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_19| 0) (not (= .cse0 0))))) (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) is different from false [2022-11-25 17:06:44,142 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse1 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_19|) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse0 (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse1) 256))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_19|)) (not (= .cse0 0)) (= (mod (mod .cse1 .cse0) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse0) (< |v_ULTIMATE.start_gcd_test_~a#1_19| 0) (not (= .cse1 0)))))) (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) is different from false [2022-11-25 17:07:07,951 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_19|) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse1 (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse0) 256))) (and (= (mod (mod .cse0 .cse1) 256) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_19|)) (not (= .cse1 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse1) (< |v_ULTIMATE.start_gcd_test_~a#1_19| 0) (not (= .cse0 0)))))) (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) is different from false [2022-11-25 17:07:30,752 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_19|) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse1 (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse0) 256))) (and (= (mod (mod .cse0 .cse1) 256) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_19|)) (not (= .cse1 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= .cse1 |c_ULTIMATE.start_gcd_test_#res#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_19| 0) (not (= .cse0 0)))))) (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) is different from false