./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_1+newton_3_5.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_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/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_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_1+newton_3_5.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/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_a1d311a8-8ced-4da8-a90f-834de8d505c8/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 8b88d28a7728931631f575ad9d71defb220443a8a6fd9744c7c34a892b41cf0b --- 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 17:55:01,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:55:01,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:55:01,078 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:55:01,078 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:55:01,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:55:01,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:55:01,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:55:01,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:55:01,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:55:01,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:55:01,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:55:01,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:55:01,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:55:01,091 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:55:01,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:55:01,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:55:01,097 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:55:01,099 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:55:01,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:55:01,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:55:01,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:55:01,104 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:55:01,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:55:01,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:55:01,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:55:01,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:55:01,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:55:01,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:55:01,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:55:01,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:55:01,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:55:01,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:55:01,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:55:01,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:55:01,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:55:01,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:55:01,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:55:01,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:55:01,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:55:01,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:55:01,122 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:55:01,144 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:55:01,144 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:55:01,145 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:55:01,145 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:55:01,146 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:55:01,169 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:55:01,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:55:01,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:55:01,172 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:55:01,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:55:01,173 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:55:01,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:55:01,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:55:01,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:55:01,174 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:55:01,174 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:55:01,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:55:01,175 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:55:01,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:55:01,175 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:55:01,175 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:55:01,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:55:01,176 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:55:01,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:55:01,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:55:01,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:55:01,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:55:01,178 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:55:01,179 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:55:01,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:55:01,180 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:55:01,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:55:01,180 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:55:01,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:55:01,181 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_a1d311a8-8ced-4da8-a90f-834de8d505c8/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_a1d311a8-8ced-4da8-a90f-834de8d505c8/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 -> 8b88d28a7728931631f575ad9d71defb220443a8a6fd9744c7c34a892b41cf0b [2022-11-25 17:55:01,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:55:01,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:55:01,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:55:01,503 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:55:01,504 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:55:01,505 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/combinations/gcd_1+newton_3_5.i [2022-11-25 17:55:04,534 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:55:04,735 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:55:04,735 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/sv-benchmarks/c/combinations/gcd_1+newton_3_5.i [2022-11-25 17:55:04,744 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/data/98c94b75c/cf3aee44c53a451294efff2611f95576/FLAG4d040146d [2022-11-25 17:55:04,766 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/data/98c94b75c/cf3aee44c53a451294efff2611f95576 [2022-11-25 17:55:04,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:55:04,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:55:04,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:55:04,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:55:04,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:55:04,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:55:04" (1/1) ... [2022-11-25 17:55:04,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dfada49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:04, skipping insertion in model container [2022-11-25 17:55:04,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:55:04" (1/1) ... [2022-11-25 17:55:04,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:55:04,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:55:05,026 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_a1d311a8-8ced-4da8-a90f-834de8d505c8/sv-benchmarks/c/combinations/gcd_1+newton_3_5.i[1226,1239] [2022-11-25 17:55:05,068 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_a1d311a8-8ced-4da8-a90f-834de8d505c8/sv-benchmarks/c/combinations/gcd_1+newton_3_5.i[2828,2841] [2022-11-25 17:55:05,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:55:05,089 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:55:05,104 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_a1d311a8-8ced-4da8-a90f-834de8d505c8/sv-benchmarks/c/combinations/gcd_1+newton_3_5.i[1226,1239] [2022-11-25 17:55:05,114 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_a1d311a8-8ced-4da8-a90f-834de8d505c8/sv-benchmarks/c/combinations/gcd_1+newton_3_5.i[2828,2841] [2022-11-25 17:55:05,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:55:05,130 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:55:05,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:05 WrapperNode [2022-11-25 17:55:05,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:55:05,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:55:05,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:55:05,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:55:05,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:05" (1/1) ... [2022-11-25 17:55:05,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:05" (1/1) ... [2022-11-25 17:55:05,167 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 90 [2022-11-25 17:55:05,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:55:05,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:55:05,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:55:05,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:55:05,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:05" (1/1) ... [2022-11-25 17:55:05,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:05" (1/1) ... [2022-11-25 17:55:05,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:05" (1/1) ... [2022-11-25 17:55:05,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:05" (1/1) ... [2022-11-25 17:55:05,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:05" (1/1) ... [2022-11-25 17:55:05,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:05" (1/1) ... [2022-11-25 17:55:05,191 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:05" (1/1) ... [2022-11-25 17:55:05,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:05" (1/1) ... [2022-11-25 17:55:05,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:55:05,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:55:05,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:55:05,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:55:05,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:05" (1/1) ... [2022-11-25 17:55:05,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:55:05,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:55:05,228 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:55:05,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:55:05,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:55:05,272 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-25 17:55:05,272 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-25 17:55:05,272 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-25 17:55:05,273 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-25 17:55:05,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:55:05,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:55:05,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:55:05,349 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:55:05,351 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:55:05,598 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:55:05,617 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:55:05,617 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 17:55:05,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:55:05 BoogieIcfgContainer [2022-11-25 17:55:05,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:55:05,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:55:05,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:55:05,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:55:05,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:55:04" (1/3) ... [2022-11-25 17:55:05,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5534c0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:55:05, skipping insertion in model container [2022-11-25 17:55:05,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:05" (2/3) ... [2022-11-25 17:55:05,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5534c0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:55:05, skipping insertion in model container [2022-11-25 17:55:05,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:55:05" (3/3) ... [2022-11-25 17:55:05,644 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_3_5.i [2022-11-25 17:55:05,669 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:55:05,669 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 17:55:05,743 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:55:05,751 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;@6815abc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:55:05,751 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-25 17:55:05,756 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 17:55:05,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 17:55:05,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:55:05,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:05,767 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:55:05,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:05,774 INFO L85 PathProgramCache]: Analyzing trace with hash -247750664, now seen corresponding path program 1 times [2022-11-25 17:55:05,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:05,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889422949] [2022-11-25 17:55:05,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:05,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:05,919 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:55:05,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1558169283] [2022-11-25 17:55:05,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:05,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:55:05,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:55:05,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:55:05,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:55:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:06,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 17:55:06,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:55:06,079 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 17:55:06,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:55:06,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:06,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889422949] [2022-11-25 17:55:06,082 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:55:06,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558169283] [2022-11-25 17:55:06,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558169283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:06,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:06,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:55:06,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675722682] [2022-11-25 17:55:06,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:06,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:55:06,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:06,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:55:06,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:55:06,173 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 17:55:06,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:55:06,230 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2022-11-25 17:55:06,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:55:06,233 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 17:55:06,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:55:06,240 INFO L225 Difference]: With dead ends: 72 [2022-11-25 17:55:06,240 INFO L226 Difference]: Without dead ends: 32 [2022-11-25 17:55:06,243 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 17:55:06,248 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 17:55:06,250 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 17:55:06,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-25 17:55:06,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-25 17:55:06,285 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 17:55:06,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-11-25 17:55:06,288 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2022-11-25 17:55:06,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:55:06,290 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-11-25 17:55:06,290 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 17:55:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-11-25 17:55:06,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 17:55:06,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:55:06,293 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:06,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:55:06,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-25 17:55:06,500 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:55:06,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash -251444748, now seen corresponding path program 1 times [2022-11-25 17:55:06,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:06,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830533062] [2022-11-25 17:55:06,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:06,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:06,518 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:55:06,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507354826] [2022-11-25 17:55:06,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:06,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:55:06,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:55:06,541 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:55:06,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:55:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:06,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:55:06,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:55:06,683 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 17:55:06,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:55:06,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:06,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830533062] [2022-11-25 17:55:06,686 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:55:06,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507354826] [2022-11-25 17:55:06,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507354826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:06,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:06,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:55:06,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062996057] [2022-11-25 17:55:06,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:06,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:55:06,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:06,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:55:06,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:55:06,690 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 17:55:06,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:55:06,711 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-11-25 17:55:06,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:55:06,712 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 17:55:06,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:55:06,713 INFO L225 Difference]: With dead ends: 39 [2022-11-25 17:55:06,713 INFO L226 Difference]: Without dead ends: 33 [2022-11-25 17:55:06,713 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 17:55:06,714 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 17:55:06,715 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 17:55:06,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-25 17:55:06,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-25 17:55:06,721 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 17:55:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-11-25 17:55:06,722 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2022-11-25 17:55:06,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:55:06,723 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-11-25 17:55:06,725 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 17:55:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-11-25 17:55:06,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 17:55:06,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:55:06,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:06,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:55:06,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:55:06,932 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:55:06,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:06,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1673157840, now seen corresponding path program 1 times [2022-11-25 17:55:06,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:06,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662306553] [2022-11-25 17:55:06,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:06,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:06,948 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:55:06,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [947820391] [2022-11-25 17:55:06,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:06,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:55:06,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:55:06,950 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:55:06,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:55:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:07,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 17:55:07,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:55:07,115 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 17:55:07,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:55:07,179 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 17:55:07,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:07,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662306553] [2022-11-25 17:55:07,180 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:55:07,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947820391] [2022-11-25 17:55:07,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947820391] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:55:07,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:55:07,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-11-25 17:55:07,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387213570] [2022-11-25 17:55:07,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:55:07,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:55:07,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:07,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:55:07,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:55:07,184 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 17:55:07,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:55:07,250 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-11-25 17:55:07,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:55:07,251 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 17:55:07,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:55:07,252 INFO L225 Difference]: With dead ends: 39 [2022-11-25 17:55:07,252 INFO L226 Difference]: Without dead ends: 34 [2022-11-25 17:55:07,253 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 17:55:07,254 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 17:55:07,255 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 17:55:07,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-25 17:55:07,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-25 17:55:07,261 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 17:55:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-11-25 17:55:07,262 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2022-11-25 17:55:07,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:55:07,262 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-11-25 17:55:07,263 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 17:55:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-11-25 17:55:07,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 17:55:07,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:55:07,264 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:07,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:55:07,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:55:07,470 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:55:07,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:07,471 INFO L85 PathProgramCache]: Analyzing trace with hash -276630798, now seen corresponding path program 2 times [2022-11-25 17:55:07,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:07,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316462073] [2022-11-25 17:55:07,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:07,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:07,485 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:55:07,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [130688373] [2022-11-25 17:55:07,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:55:07,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:55:07,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:55:07,487 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:55:07,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:55:17,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:55:17,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:55:17,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-25 17:55:17,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:57:35,751 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 17:57:56,346 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 17:58:18,662 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 17:58:37,487 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 17:58:39,489 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 17:58:56,478 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:58:56,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:02:54,551 WARN L233 SmtUtils]: Spent 2.89m on a formula simplification that was a NOOP. DAG size: 114 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:03:11,373 WARN L859 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (let ((.cse11 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse14 (mod (+ .cse11 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse7 (mod .cse11 256)) (.cse1 (<= .cse14 127)) (.cse12 (= .cse14 0)) (.cse13 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse14) 256) 0))) (.cse3 (not .cse8))) (let ((.cse2 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse14)) 256) 0))) (.cse5 (or .cse12 .cse13 .cse3)) (.cse6 (not .cse1)) (.cse0 (<= .cse7 127))) (and (or .cse0 (let ((.cse4 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse7)) 256) 0)) .cse8))) (and (or .cse1 (and (or .cse2 .cse3) .cse4)) (or (and .cse4 .cse5) .cse6)))) (or (let ((.cse10 (or .cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 0)) (= .cse7 0))) (.cse9 (= .cse11 0))) (and (or (and (or .cse9 .cse2 .cse3) .cse10) .cse1) (or (and .cse10 (or (and .cse10 .cse5) (not (<= (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))) (or .cse9 .cse12 .cse13 .cse3)) .cse6))) (not .cse0)))))))) is different from true [2022-11-25 18:03:39,192 WARN L233 SmtUtils]: Spent 16.13s on a formula simplification. DAG size of input: 42 DAG size of output: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:03:52,057 WARN L859 $PredicateComparison]: unable to prove that (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse1 (<= .cse2 127))) (and (let ((.cse0 (mod (+ .cse2 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse0 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) .cse1 (= .cse0 0))) (let ((.cse3 (mod (mod .cse2 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (not .cse1) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse3) 256) 0)) (= .cse3 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 18:04:39,057 WARN L837 $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 false [2022-11-25 18:04:41,060 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 18:04:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:04:57,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:04:57,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316462073] [2022-11-25 18:04:57,627 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 18:04:57,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130688373] [2022-11-25 18:04:57,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130688373] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:04:57,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:04:57,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 19 [2022-11-25 18:04:57,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953412884] [2022-11-25 18:04:57,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:04:57,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 18:04:57,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:04:57,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 18:04:57,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=99, Unknown=20, NotChecked=182, Total=342 [2022-11-25 18:04:57,629 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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 18:05:52,609 WARN L233 SmtUtils]: Spent 46.06s 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 18:06:44,981 WARN L233 SmtUtils]: Spent 46.32s on a formula simplification. DAG size of input: 52 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:06:47,022 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 18:06:49,025 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 18:06:51,573 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse38 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse36 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse37 (mod (+ .cse38 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse32 (= .cse37 0)) (.cse33 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse37) 256) 0))) (.cse22 (not .cse36)) (.cse35 (mod .cse38 256)) (.cse29 (mod (+ .cse38 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse3 (<= .cse37 127)) (.cse15 (<= .cse29 127)) (.cse26 (= .cse38 0)) (.cse8 (or .cse36 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse35) 256) 0)) (= .cse35 0))) (.cse2 (<= .cse35 127)) (.cse34 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse37)) 256) 0))) (.cse19 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse35)) 256) 0)) .cse36)) (.cse9 (or .cse32 .cse33 .cse22))) (let ((.cse5 (and .cse19 .cse9)) (.cse4 (and (or .cse34 .cse22) .cse19)) (.cse12 (not .cse2)) (.cse7 (and (or .cse26 .cse34 .cse22) .cse8)) (.cse10 (not .cse15)) (.cse11 (or .cse26 .cse32 .cse33 .cse22)) (.cse6 (not .cse3)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (or .cse0 .cse1 (and (or .cse2 (and (or .cse3 .cse4) (or .cse5 .cse6))) (or (and (or .cse7 .cse3) (or (and .cse8 (or (and .cse8 .cse9) .cse10) .cse11) .cse6)) .cse12))) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (or (let ((.cse25 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse29) 256) 0))) (.cse27 (= .cse29 0))) (let ((.cse20 (or .cse25 .cse22 .cse27)) (.cse18 (not .cse0)) (.cse21 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse29)) 256) 0)))) (and (or (let ((.cse14 (or .cse18 (and (or .cse21 .cse22) .cse19))) (.cse16 (or .cse18 (and .cse19 .cse20)))) (and (or (let ((.cse13 (or .cse5 .cse0))) (and (or (and .cse13 .cse14) .cse15) (or .cse10 (and .cse16 .cse13)))) .cse6) (or (let ((.cse17 (or .cse0 .cse4))) (and (or (and .cse14 .cse17) .cse15) (or (and .cse16 .cse17) .cse10))) .cse3))) .cse2) (or .cse12 (let ((.cse24 (or .cse18 (and .cse8 (or .cse26 .cse21 .cse22))))) (and (or (let ((.cse23 (or .cse7 .cse0))) (and (or .cse15 (and .cse23 .cse24)) (or (and (or .cse18 (and .cse8 (or .cse25 .cse26 .cse22 .cse27))) .cse23) .cse10))) .cse3) (or (let ((.cse28 (or .cse0 (and .cse8 .cse11)))) (and (or .cse10 (and (or .cse18 (and .cse8 .cse20)) .cse28)) (or (and .cse28 .cse24) .cse15))) .cse6))))))) .cse1) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (< 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 18:06:53,580 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse38 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse36 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse37 (mod (+ .cse38 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse32 (= .cse37 0)) (.cse33 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse37) 256) 0))) (.cse22 (not .cse36)) (.cse35 (mod .cse38 256)) (.cse29 (mod (+ .cse38 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse3 (<= .cse37 127)) (.cse15 (<= .cse29 127)) (.cse26 (= .cse38 0)) (.cse8 (or .cse36 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse35) 256) 0)) (= .cse35 0))) (.cse2 (<= .cse35 127)) (.cse34 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse37)) 256) 0))) (.cse19 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse35)) 256) 0)) .cse36)) (.cse9 (or .cse32 .cse33 .cse22))) (let ((.cse5 (and .cse19 .cse9)) (.cse4 (and (or .cse34 .cse22) .cse19)) (.cse12 (not .cse2)) (.cse7 (and (or .cse26 .cse34 .cse22) .cse8)) (.cse10 (not .cse15)) (.cse11 (or .cse26 .cse32 .cse33 .cse22)) (.cse6 (not .cse3)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (or .cse0 .cse1 (and (or .cse2 (and (or .cse3 .cse4) (or .cse5 .cse6))) (or (and (or .cse7 .cse3) (or (and .cse8 (or (and .cse8 .cse9) .cse10) .cse11) .cse6)) .cse12))) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (or (let ((.cse25 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse29) 256) 0))) (.cse27 (= .cse29 0))) (let ((.cse20 (or .cse25 .cse22 .cse27)) (.cse18 (not .cse0)) (.cse21 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse29)) 256) 0)))) (and (or (let ((.cse14 (or .cse18 (and (or .cse21 .cse22) .cse19))) (.cse16 (or .cse18 (and .cse19 .cse20)))) (and (or (let ((.cse13 (or .cse5 .cse0))) (and (or (and .cse13 .cse14) .cse15) (or .cse10 (and .cse16 .cse13)))) .cse6) (or (let ((.cse17 (or .cse0 .cse4))) (and (or (and .cse14 .cse17) .cse15) (or (and .cse16 .cse17) .cse10))) .cse3))) .cse2) (or .cse12 (let ((.cse24 (or .cse18 (and .cse8 (or .cse26 .cse21 .cse22))))) (and (or (let ((.cse23 (or .cse7 .cse0))) (and (or .cse15 (and .cse23 .cse24)) (or (and (or .cse18 (and .cse8 (or .cse25 .cse26 .cse22 .cse27))) .cse23) .cse10))) .cse3) (or (let ((.cse28 (or .cse0 (and .cse8 .cse11)))) (and (or .cse10 (and (or .cse18 (and .cse8 .cse20)) .cse28)) (or (and .cse28 .cse24) .cse15))) .cse6))))))) .cse1) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (< 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 true [2022-11-25 18:06:55,618 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 18:06:57,623 WARN L859 $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 true [2022-11-25 18:07:23,961 WARN L233 SmtUtils]: Spent 17.68s 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 18:09:06,269 WARN L233 SmtUtils]: Spent 1.60m on a formula simplification. DAG size of input: 144 DAG size of output: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:09:08,273 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 18:09:10,280 WARN L837 $PredicateComparison]: unable to prove that (and (or (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (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 ((.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 18:09:12,286 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 128))) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 256) 0)) (not (<= |c_ULTIMATE.start_gcd_test_~b#1| 127)) .cse0) (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)))))) is different from false [2022-11-25 18:09:14,327 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse29 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse19 (mod .cse29 256))) (let ((.cse0 (= .cse19 0)) (.cse32 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse11 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse10 (not .cse20)) (.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 ((.cse30 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse31 (mod (+ .cse29 .cse32) 256))) (let ((.cse15 (<= .cse31 127)) (.cse25 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 0))) (.cse27 (= .cse30 0)) (.cse4 (<= .cse30 127))) (let ((.cse21 (<= .cse19 127)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse31)) 256) 0))) (.cse5 (not .cse4)) (.cse17 (or .cse25 .cse10 .cse27)) (.cse8 (= .cse31 0)) (.cse9 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse31) 256) 0))) (.cse12 (not .cse15)) (.cse16 (not .cse11)) (.cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse30)) 256) 0)))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse19)) 256) 0)) .cse20))) (let ((.cse3 (or .cse16 (and (or .cse18 .cse10) .cse7))) (.cse6 (or .cse16 (and .cse7 .cse17)))) (and (or (let ((.cse2 (or (and .cse7 (or .cse8 .cse9 .cse10)) .cse11))) (and (or (and .cse2 .cse3) .cse4) (or .cse5 (and .cse6 .cse2)))) .cse12) (or (let ((.cse13 (or .cse11 (and (or .cse14 .cse10) .cse7)))) (and (or (and .cse3 .cse13) .cse4) (or (and .cse6 .cse13) .cse5))) .cse15)))) .cse21) (or (not .cse21) (let ((.cse24 (or .cse20 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0)) .cse0)) (.cse26 (= .cse29 0))) (let ((.cse23 (or .cse16 (and .cse24 (or .cse26 .cse18 .cse10))))) (and (or (let ((.cse22 (or (and (or .cse26 .cse14 .cse10) .cse24) .cse11))) (and (or .cse4 (and .cse22 .cse23)) (or (and (or .cse16 (and .cse24 (or .cse25 .cse26 .cse10 .cse27))) .cse22) .cse5))) .cse15) (or (let ((.cse28 (or .cse11 (and .cse24 (or .cse26 .cse8 .cse9 .cse10))))) (and (or .cse5 (and (or .cse16 (and .cse24 .cse17)) .cse28)) (or (and .cse28 .cse23) .cse4))) .cse12))))))))) .cse1) (or (let ((.cse35 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse33 (<= .cse35 127))) (and (let ((.cse34 (mod (mod .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse33) (= 0 .cse34) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse34) 256) 0)))) (let ((.cse36 (mod (+ .cse35 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse36 .cse32) 256))) 256) 0)) .cse33 (= .cse36 0)))))) .cse11 .cse10 .cse1))))) is different from false [2022-11-25 18:09:16,333 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse29 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse19 (mod .cse29 256))) (let ((.cse0 (= .cse19 0)) (.cse32 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse11 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse10 (not .cse20)) (.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 ((.cse30 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse31 (mod (+ .cse29 .cse32) 256))) (let ((.cse15 (<= .cse31 127)) (.cse25 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 0))) (.cse27 (= .cse30 0)) (.cse4 (<= .cse30 127))) (let ((.cse21 (<= .cse19 127)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse31)) 256) 0))) (.cse5 (not .cse4)) (.cse17 (or .cse25 .cse10 .cse27)) (.cse8 (= .cse31 0)) (.cse9 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse31) 256) 0))) (.cse12 (not .cse15)) (.cse16 (not .cse11)) (.cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse30)) 256) 0)))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse19)) 256) 0)) .cse20))) (let ((.cse3 (or .cse16 (and (or .cse18 .cse10) .cse7))) (.cse6 (or .cse16 (and .cse7 .cse17)))) (and (or (let ((.cse2 (or (and .cse7 (or .cse8 .cse9 .cse10)) .cse11))) (and (or (and .cse2 .cse3) .cse4) (or .cse5 (and .cse6 .cse2)))) .cse12) (or (let ((.cse13 (or .cse11 (and (or .cse14 .cse10) .cse7)))) (and (or (and .cse3 .cse13) .cse4) (or (and .cse6 .cse13) .cse5))) .cse15)))) .cse21) (or (not .cse21) (let ((.cse24 (or .cse20 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0)) .cse0)) (.cse26 (= .cse29 0))) (let ((.cse23 (or .cse16 (and .cse24 (or .cse26 .cse18 .cse10))))) (and (or (let ((.cse22 (or (and (or .cse26 .cse14 .cse10) .cse24) .cse11))) (and (or .cse4 (and .cse22 .cse23)) (or (and (or .cse16 (and .cse24 (or .cse25 .cse26 .cse10 .cse27))) .cse22) .cse5))) .cse15) (or (let ((.cse28 (or .cse11 (and .cse24 (or .cse26 .cse8 .cse9 .cse10))))) (and (or .cse5 (and (or .cse16 (and .cse24 .cse17)) .cse28)) (or (and .cse28 .cse23) .cse4))) .cse12))))))))) .cse1) (or (let ((.cse35 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse33 (<= .cse35 127))) (and (let ((.cse34 (mod (mod .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse33) (= 0 .cse34) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse34) 256) 0)))) (let ((.cse36 (mod (+ .cse35 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse36 .cse32) 256))) 256) 0)) .cse33 (= .cse36 0)))))) .cse11 .cse10 .cse1))))) is different from true [2022-11-25 18:09:18,354 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse29 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse19 (mod .cse29 256))) (let ((.cse0 (= .cse19 0)) (.cse32 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse11 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse10 (not .cse20)) (.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 (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)))) (or (let ((.cse30 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse31 (mod (+ .cse29 .cse32) 256))) (let ((.cse15 (<= .cse31 127)) (.cse25 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 0))) (.cse27 (= .cse30 0)) (.cse4 (<= .cse30 127))) (let ((.cse21 (<= .cse19 127)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse31)) 256) 0))) (.cse5 (not .cse4)) (.cse17 (or .cse25 .cse10 .cse27)) (.cse8 (= .cse31 0)) (.cse9 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse31) 256) 0))) (.cse12 (not .cse15)) (.cse16 (not .cse11)) (.cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse30)) 256) 0)))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse19)) 256) 0)) .cse20))) (let ((.cse3 (or .cse16 (and (or .cse18 .cse10) .cse7))) (.cse6 (or .cse16 (and .cse7 .cse17)))) (and (or (let ((.cse2 (or (and .cse7 (or .cse8 .cse9 .cse10)) .cse11))) (and (or (and .cse2 .cse3) .cse4) (or .cse5 (and .cse6 .cse2)))) .cse12) (or (let ((.cse13 (or .cse11 (and (or .cse14 .cse10) .cse7)))) (and (or (and .cse3 .cse13) .cse4) (or (and .cse6 .cse13) .cse5))) .cse15)))) .cse21) (or (not .cse21) (let ((.cse24 (or .cse20 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0)) .cse0)) (.cse26 (= .cse29 0))) (let ((.cse23 (or .cse16 (and .cse24 (or .cse26 .cse18 .cse10))))) (and (or (let ((.cse22 (or (and (or .cse26 .cse14 .cse10) .cse24) .cse11))) (and (or .cse4 (and .cse22 .cse23)) (or (and (or .cse16 (and .cse24 (or .cse25 .cse26 .cse10 .cse27))) .cse22) .cse5))) .cse15) (or (let ((.cse28 (or .cse11 (and .cse24 (or .cse26 .cse8 .cse9 .cse10))))) (and (or .cse5 (and (or .cse16 (and .cse24 .cse17)) .cse28)) (or (and .cse28 .cse23) .cse4))) .cse12))))))))) .cse1) (or (let ((.cse35 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse33 (<= .cse35 127))) (and (let ((.cse34 (mod (mod .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse33) (= 0 .cse34) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse34) 256) 0)))) (let ((.cse36 (mod (+ .cse35 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse36 .cse32) 256))) 256) 0)) .cse33 (= .cse36 0)))))) .cse11 .cse10 .cse1))))) is different from false [2022-11-25 18:09:21,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-25 18:09:23,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-25 18:09:23,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:09:23,219 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-11-25 18:09:23,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:09:23,220 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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 18:09:23,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:09:23,221 INFO L225 Difference]: With dead ends: 47 [2022-11-25 18:09:23,221 INFO L226 Difference]: Without dead ends: 40 [2022-11-25 18:09:23,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 503.3s TimeCoverageRelationStatistics Valid=76, Invalid=178, Unknown=38, NotChecked=520, Total=812 [2022-11-25 18:09:23,223 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 9 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:09:23,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 381 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 3 Unknown, 173 Unchecked, 10.4s Time] [2022-11-25 18:09:23,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-25 18:09:23,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-11-25 18:09:23,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 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 18:09:23,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-11-25 18:09:23,235 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 13 [2022-11-25 18:09:23,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:09:23,236 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-11-25 18:09:23,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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 18:09:23,236 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-11-25 18:09:23,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 18:09:23,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:09:23,237 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:09:23,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-25 18:09:23,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:09:23,438 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:09:23,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:09:23,439 INFO L85 PathProgramCache]: Analyzing trace with hash 66034544, now seen corresponding path program 3 times [2022-11-25 18:09:23,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:09:23,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067595648] [2022-11-25 18:09:23,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:09:23,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:09:23,449 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 18:09:23,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1925689099] [2022-11-25 18:09:23,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:09:23,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:09:23,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:09:23,451 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:09:23,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1d311a8-8ced-4da8-a90f-834de8d505c8/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:09:40,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 18:09:40,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:09:40,655 WARN L261 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-25 18:09:40,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:10:23,047 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