./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_1+newton_2_1.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_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/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_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_1+newton_2_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/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_95cb327a-199b-4ce9-9ed9-161e93d45375/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 dc4c84af925d120ea9b9db9aa78160f13c1157e642c02b4448c62c56bbe753dd --- 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:57:34,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:57:34,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:57:34,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:57:34,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:57:34,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:57:34,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:57:34,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:57:34,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:57:34,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:57:34,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:57:34,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:57:34,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:57:34,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:57:34,053 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:57:34,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:57:34,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:57:34,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:57:34,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:57:34,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:57:34,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:57:34,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:57:34,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:57:34,089 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:57:34,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:57:34,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:57:34,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:57:34,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:57:34,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:57:34,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:57:34,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:57:34,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:57:34,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:57:34,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:57:34,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:57:34,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:57:34,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:57:34,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:57:34,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:57:34,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:57:34,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:57:34,116 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:57:34,154 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:57:34,154 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:57:34,155 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:57:34,155 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:57:34,156 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:57:34,156 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:57:34,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:57:34,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:57:34,158 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:57:34,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:57:34,160 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:57:34,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:57:34,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:57:34,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:57:34,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:57:34,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:57:34,161 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:57:34,162 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:57:34,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:57:34,162 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:57:34,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:57:34,162 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:57:34,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:57:34,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:57:34,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:57:34,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:57:34,163 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:57:34,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:57:34,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:57:34,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:57:34,165 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:57:34,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:57:34,165 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:57:34,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:57:34,166 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_95cb327a-199b-4ce9-9ed9-161e93d45375/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_95cb327a-199b-4ce9-9ed9-161e93d45375/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 -> dc4c84af925d120ea9b9db9aa78160f13c1157e642c02b4448c62c56bbe753dd [2022-11-25 17:57:34,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:57:34,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:57:34,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:57:34,466 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:57:34,467 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:57:34,468 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/combinations/gcd_1+newton_2_1.i [2022-11-25 17:57:37,630 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:57:37,906 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:57:37,907 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/sv-benchmarks/c/combinations/gcd_1+newton_2_1.i [2022-11-25 17:57:37,917 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/data/aeab75e93/6b7dbb76ae2949fabd3db5a53c88e497/FLAG7837a2ee9 [2022-11-25 17:57:37,931 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/data/aeab75e93/6b7dbb76ae2949fabd3db5a53c88e497 [2022-11-25 17:57:37,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:57:37,936 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:57:37,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:57:37,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:57:37,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:57:37,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:57:37" (1/1) ... [2022-11-25 17:57:37,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bef41f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:37, skipping insertion in model container [2022-11-25 17:57:37,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:57:37" (1/1) ... [2022-11-25 17:57:37,962 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:57:37,981 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:57:38,132 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_95cb327a-199b-4ce9-9ed9-161e93d45375/sv-benchmarks/c/combinations/gcd_1+newton_2_1.i[1226,1239] [2022-11-25 17:57:38,157 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_95cb327a-199b-4ce9-9ed9-161e93d45375/sv-benchmarks/c/combinations/gcd_1+newton_2_1.i[2807,2820] [2022-11-25 17:57:38,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:57:38,169 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:57:38,183 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_95cb327a-199b-4ce9-9ed9-161e93d45375/sv-benchmarks/c/combinations/gcd_1+newton_2_1.i[1226,1239] [2022-11-25 17:57:38,193 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_95cb327a-199b-4ce9-9ed9-161e93d45375/sv-benchmarks/c/combinations/gcd_1+newton_2_1.i[2807,2820] [2022-11-25 17:57:38,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:57:38,207 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:57:38,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:38 WrapperNode [2022-11-25 17:57:38,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:57:38,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:57:38,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:57:38,209 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:57:38,215 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:57:38" (1/1) ... [2022-11-25 17:57:38,222 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:57:38" (1/1) ... [2022-11-25 17:57:38,244 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2022-11-25 17:57:38,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:57:38,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:57:38,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:57:38,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:57:38,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:38" (1/1) ... [2022-11-25 17:57:38,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:38" (1/1) ... [2022-11-25 17:57:38,256 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:38" (1/1) ... [2022-11-25 17:57:38,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:38" (1/1) ... [2022-11-25 17:57:38,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:38" (1/1) ... [2022-11-25 17:57:38,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:38" (1/1) ... [2022-11-25 17:57:38,267 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:38" (1/1) ... [2022-11-25 17:57:38,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:38" (1/1) ... [2022-11-25 17:57:38,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:57:38,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:57:38,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:57:38,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:57:38,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:38" (1/1) ... [2022-11-25 17:57:38,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:57:38,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:57:38,323 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:57:38,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:57:38,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:57:38,369 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-25 17:57:38,369 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-25 17:57:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-25 17:57:38,375 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-25 17:57:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:57:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:57:38,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:57:38,455 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:57:38,456 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:57:38,635 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:57:38,642 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:57:38,642 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 17:57:38,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:57:38 BoogieIcfgContainer [2022-11-25 17:57:38,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:57:38,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:57:38,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:57:38,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:57:38,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:57:37" (1/3) ... [2022-11-25 17:57:38,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39961e6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:57:38, skipping insertion in model container [2022-11-25 17:57:38,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:57:38" (2/3) ... [2022-11-25 17:57:38,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39961e6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:57:38, skipping insertion in model container [2022-11-25 17:57:38,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:57:38" (3/3) ... [2022-11-25 17:57:38,655 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_2_1.i [2022-11-25 17:57:38,693 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:57:38,694 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 17:57:38,786 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:57:38,797 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;@372a0a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:57:38,797 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-25 17:57:38,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:57:38,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 17:57:38,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:57:38,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:57:38,816 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:57:38,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:57:38,821 INFO L85 PathProgramCache]: Analyzing trace with hash -247750664, now seen corresponding path program 1 times [2022-11-25 17:57:38,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:57:38,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059995682] [2022-11-25 17:57:38,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:57:38,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:57:38,924 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:57:38,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1993933949] [2022-11-25 17:57:38,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:57:38,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:57:38,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:57:38,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:57:38,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:57:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:57:39,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 17:57:39,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:57:39,035 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:57:39,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:57:39,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:57:39,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059995682] [2022-11-25 17:57:39,037 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:57:39,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993933949] [2022-11-25 17:57:39,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993933949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:57:39,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:57:39,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:57:39,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456416943] [2022-11-25 17:57:39,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:57:39,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:57:39,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:57:39,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:57:39,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:57:39,079 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 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:57:39,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:57:39,102 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-11-25 17:57:39,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:57:39,104 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:57:39,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:57:39,111 INFO L225 Difference]: With dead ends: 66 [2022-11-25 17:57:39,111 INFO L226 Difference]: Without dead ends: 29 [2022-11-25 17:57:39,114 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:57:39,118 INFO L413 NwaCegarLoop]: 43 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, 43 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:57:39,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:57:39,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-25 17:57:39,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-25 17:57:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:57:39,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-11-25 17:57:39,155 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 11 [2022-11-25 17:57:39,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:57:39,156 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-11-25 17:57:39,156 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:57:39,156 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-11-25 17:57:39,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 17:57:39,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:57:39,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:57:39,163 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 17:57:39,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:57:39,359 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:57:39,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:57:39,360 INFO L85 PathProgramCache]: Analyzing trace with hash -251444748, now seen corresponding path program 1 times [2022-11-25 17:57:39,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:57:39,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858212694] [2022-11-25 17:57:39,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:57:39,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:57:39,378 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:57:39,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [363920823] [2022-11-25 17:57:39,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:57:39,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:57:39,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:57:39,380 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:57:39,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:57:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:57:39,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:57:39,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:57:39,579 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:57:39,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:57:39,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:57:39,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858212694] [2022-11-25 17:57:39,581 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:57:39,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363920823] [2022-11-25 17:57:39,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363920823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:57:39,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:57:39,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:57:39,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965949457] [2022-11-25 17:57:39,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:57:39,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:57:39,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:57:39,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:57:39,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:57:39,597 INFO L87 Difference]: Start difference. First operand 29 states and 33 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:57:39,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:57:39,621 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-11-25 17:57:39,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:57:39,623 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:57:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:57:39,625 INFO L225 Difference]: With dead ends: 36 [2022-11-25 17:57:39,625 INFO L226 Difference]: Without dead ends: 30 [2022-11-25 17:57:39,625 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:57:39,630 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 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:57:39,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:57:39,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-25 17:57:39,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-25 17:57:39,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:57:39,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-25 17:57:39,643 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-11-25 17:57:39,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:57:39,644 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-25 17:57:39,644 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:57:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-25 17:57:39,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 17:57:39,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:57:39,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:57:39,652 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:57:39,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:57:39,851 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:57:39,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:57:39,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1673157840, now seen corresponding path program 1 times [2022-11-25 17:57:39,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:57:39,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561325660] [2022-11-25 17:57:39,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:57:39,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:57:39,871 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:57:39,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123538340] [2022-11-25 17:57:39,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:57:39,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:57:39,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:57:39,879 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:57:39,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:57:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:57:39,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 17:57:39,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:57:40,105 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:57:40,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:57:40,159 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:57:40,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:57:40,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561325660] [2022-11-25 17:57:40,160 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:57:40,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123538340] [2022-11-25 17:57:40,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123538340] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:57:40,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:57:40,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-11-25 17:57:40,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254401791] [2022-11-25 17:57:40,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:57:40,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:57:40,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:57:40,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:57:40,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:57:40,164 INFO L87 Difference]: Start difference. First operand 30 states and 33 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:57:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:57:40,273 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-11-25 17:57:40,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:57:40,274 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:57:40,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:57:40,275 INFO L225 Difference]: With dead ends: 36 [2022-11-25 17:57:40,275 INFO L226 Difference]: Without dead ends: 31 [2022-11-25 17:57:40,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:57:40,277 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 155 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:57:40,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 155 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:57:40,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-25 17:57:40,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-25 17:57:40,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 17:57:40,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-11-25 17:57:40,283 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 12 [2022-11-25 17:57:40,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:57:40,284 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-11-25 17:57:40,284 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:57:40,284 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-11-25 17:57:40,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 17:57:40,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:57:40,285 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:57:40,295 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-25 17:57:40,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:57:40,495 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:57:40,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:57:40,496 INFO L85 PathProgramCache]: Analyzing trace with hash -276630798, now seen corresponding path program 2 times [2022-11-25 17:57:40,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:57:40,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594480487] [2022-11-25 17:57:40,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:57:40,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:57:40,509 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:57:40,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [431368050] [2022-11-25 17:57:40,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:57:40,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:57:40,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:57:40,510 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:57:40,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:57:50,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:57:50,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:57:50,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-25 17:57:50,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:58:41,244 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (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| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-25 17:59:01,335 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (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) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-25 17:59:22,358 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:59:42,048 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:59:44,054 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 18:00:00,604 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 18:00:00,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:04:16,434 WARN L233 SmtUtils]: Spent 3.14m 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:05:25,004 WARN L233 SmtUtils]: Spent 42.71s on a formula simplification. DAG size of input: 67 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:05:50,737 WARN L233 SmtUtils]: Spent 7.12s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:06:09,351 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:06:58,786 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:07:00,789 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:07:19,675 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:07:19,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:07:19,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594480487] [2022-11-25 18:07:19,676 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 18:07:19,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431368050] [2022-11-25 18:07:19,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431368050] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:07:19,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:07:19,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 19 [2022-11-25 18:07:19,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547268672] [2022-11-25 18:07:19,677 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:07:19,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 18:07:19,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:07:19,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 18:07:19,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=115, Unknown=22, NotChecked=162, Total=342 [2022-11-25 18:07:19,678 INFO L87 Difference]: Start difference. First operand 31 states and 34 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:08:11,347 WARN L233 SmtUtils]: Spent 42.77s 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:08:13,541 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (= (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (let ((.cse2 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse0 (<= .cse2 127))) (and (let ((.cse1 (mod (mod .cse2 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse0) (= 0 .cse1) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse1) 256) 0)))) (let ((.cse3 (mod (+ .cse2 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) 256) 0)) .cse0 (= .cse3 0)))))) (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (< 0 |c_ULTIMATE.start_gcd_test_~b#1|)) is different from false [2022-11-25 18:09:25,794 WARN L233 SmtUtils]: Spent 1.06m on a formula simplification. DAG size of input: 83 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:09:28,092 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:42,715 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:10:28,058 WARN L233 SmtUtils]: Spent 30.79s on a formula simplification. DAG size of input: 45 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:10:30,502 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:10:32,508 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)) (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| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-25 18:10:34,540 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:10:36,545 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:10:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:10:36,553 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-11-25 18:10:36,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:10:36,554 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:10:36,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:10:36,555 INFO L225 Difference]: With dead ends: 40 [2022-11-25 18:10:36,555 INFO L226 Difference]: Without dead ends: 35 [2022-11-25 18:10:36,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 496.8s TimeCoverageRelationStatistics Valid=64, Invalid=177, Unknown=35, NotChecked=324, Total=600 [2022-11-25 18:10:36,556 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:10:36,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 225 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 3 Unknown, 115 Unchecked, 7.5s Time] [2022-11-25 18:10:36,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-25 18:10:36,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-11-25 18:10:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 18:10:36,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-11-25 18:10:36,564 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 13 [2022-11-25 18:10:36,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:10:36,565 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-11-25 18:10:36,565 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:10:36,565 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-11-25 18:10:36,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 18:10:36,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:10:36,566 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:10:36,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-25 18:10:36,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:36,770 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:10:36,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:10:36,771 INFO L85 PathProgramCache]: Analyzing trace with hash 403427572, now seen corresponding path program 1 times [2022-11-25 18:10:36,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:10:36,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848229179] [2022-11-25 18:10:36,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:36,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:10:36,781 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 18:10:36,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [327858353] [2022-11-25 18:10:36,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:10:36,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:10:36,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:10:36,783 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:10:36,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95cb327a-199b-4ce9-9ed9-161e93d45375/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:10:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:10:36,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-25 18:10:36,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:10:37,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:10:37,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:11:19,964 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse27 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (< |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 ((.cse5 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse9 (<= .cse29 127)) (.cse3 (<= .cse28 127)) (.cse22 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse28) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse24 (= .cse28 0)) (.cse25 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse29) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse26 (= .cse29 0)) (.cse12 (not .cse16)) (.cse17 (mod .cse27 256))) (let ((.cse18 (<= .cse17 127)) (.cse11 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse29)) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse6 (or .cse25 .cse26 .cse12)) (.cse14 (or .cse22 .cse12 .cse24)) (.cse0 (not .cse3)) (.cse8 (not .cse9)) (.cse13 (not .cse5)) (.cse15 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse28)) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (and (or (let ((.cse7 (or .cse16 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse17)) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))))) (let ((.cse4 (or (and .cse7 (or .cse15 .cse12)) .cse13)) (.cse2 (or .cse13 (and .cse14 .cse7)))) (and (or (let ((.cse1 (or .cse5 (and .cse6 .cse7)))) (and (or .cse0 (and .cse1 .cse2)) (or .cse3 (and .cse4 .cse1)))) .cse8) (or .cse9 (let ((.cse10 (or .cse5 (and (or .cse11 .cse12) .cse7)))) (and (or (and .cse4 .cse10) .cse3) (or .cse0 (and .cse10 .cse2)))))))) .cse18) (or (not .cse18) (let ((.cse21 (or .cse16 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse17) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (= .cse17 0))) (.cse23 (= .cse27 0))) (let ((.cse20 (or .cse13 (and .cse21 (or .cse23 .cse15 .cse12))))) (and (or (let ((.cse19 (or .cse5 (and .cse21 (or .cse23 .cse11 .cse12))))) (and (or .cse3 (and .cse19 .cse20)) (or .cse0 (and (or (and .cse21 (or .cse22 .cse23 .cse12 .cse24)) .cse13) .cse19)))) .cse9) (or (and (or (and .cse20 (or .cse5 (and (or .cse23 .cse25 .cse26 .cse12) .cse21))) .cse3) (or (and (or (and .cse6 .cse21) .cse5) (or .cse13 (and .cse21 .cse14))) .cse0)) .cse8)))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from false [2022-11-25 18:12:33,868 WARN L233 SmtUtils]: Spent 1.04m on a formula simplification. DAG size of input: 62 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 18:12:33,890 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 18:12:33,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:12:33,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848229179] [2022-11-25 18:12:33,890 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 18:12:33,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327858353] [2022-11-25 18:12:33,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327858353] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:12:33,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:12:33,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2022-11-25 18:12:33,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55724884] [2022-11-25 18:12:33,891 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:12:33,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:12:33,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:12:33,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:12:33,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=37, Unknown=1, NotChecked=12, Total=72 [2022-11-25 18:12:33,893 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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)