./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_1+newton_2_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_1+newton_2_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8 --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 9a3e0b52eabe0a038e4774a376f7ed1eb95ce84c8d3569b2d9d7df15f27e8bd7 --- 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-2329fc7 [2022-12-13 18:44:51,713 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:44:51,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:44:51,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:44:51,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:44:51,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:44:51,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:44:51,738 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:44:51,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:44:51,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:44:51,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:44:51,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:44:51,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:44:51,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:44:51,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:44:51,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:44:51,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:44:51,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:44:51,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:44:51,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:44:51,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:44:51,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:44:51,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:44:51,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:44:51,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:44:51,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:44:51,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:44:51,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:44:51,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:44:51,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:44:51,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:44:51,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:44:51,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:44:51,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:44:51,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:44:51,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:44:51,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:44:51,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:44:51,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:44:51,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:44:51,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:44:51,759 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 18:44:51,773 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:44:51,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:44:51,773 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:44:51,773 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:44:51,773 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:44:51,774 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:44:51,774 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:44:51,774 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:44:51,774 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:44:51,774 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:44:51,774 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:44:51,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:44:51,775 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:44:51,775 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:44:51,775 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 18:44:51,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:44:51,775 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 18:44:51,775 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:44:51,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 18:44:51,775 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:44:51,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 18:44:51,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:44:51,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:44:51,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:44:51,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:44:51,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:44:51,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:44:51,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 18:44:51,776 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:44:51,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 18:44:51,776 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:44:51,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 18:44:51,776 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:44:51,777 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:44:51,777 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:44:51,777 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_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/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_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8 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 -> 9a3e0b52eabe0a038e4774a376f7ed1eb95ce84c8d3569b2d9d7df15f27e8bd7 [2022-12-13 18:44:51,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:44:51,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:44:51,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:44:51,966 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:44:51,966 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:44:51,967 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/combinations/gcd_1+newton_2_3.i [2022-12-13 18:44:54,575 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:44:54,710 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:44:54,711 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/sv-benchmarks/c/combinations/gcd_1+newton_2_3.i [2022-12-13 18:44:54,716 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/data/fa1bfb649/ec8334f4fb6546af94b41188266b2fb4/FLAGea733c636 [2022-12-13 18:44:54,729 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/data/fa1bfb649/ec8334f4fb6546af94b41188266b2fb4 [2022-12-13 18:44:54,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:44:54,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:44:54,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:44:54,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:44:54,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:44:54,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:44:54" (1/1) ... [2022-12-13 18:44:54,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@271631b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:44:54, skipping insertion in model container [2022-12-13 18:44:54,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:44:54" (1/1) ... [2022-12-13 18:44:54,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:44:54,761 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:44:54,881 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_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/sv-benchmarks/c/combinations/gcd_1+newton_2_3.i[1226,1239] [2022-12-13 18:44:54,905 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_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/sv-benchmarks/c/combinations/gcd_1+newton_2_3.i[2807,2820] [2022-12-13 18:44:54,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:44:54,918 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:44:54,929 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_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/sv-benchmarks/c/combinations/gcd_1+newton_2_3.i[1226,1239] [2022-12-13 18:44:54,939 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_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/sv-benchmarks/c/combinations/gcd_1+newton_2_3.i[2807,2820] [2022-12-13 18:44:54,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:44:54,956 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:44:54,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:44:54 WrapperNode [2022-12-13 18:44:54,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:44:54,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:44:54,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:44:54,958 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:44:54,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:44:54" (1/1) ... [2022-12-13 18:44:54,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:44:54" (1/1) ... [2022-12-13 18:44:54,994 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2022-12-13 18:44:54,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:44:54,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:44:54,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:44:54,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:44:55,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:44:54" (1/1) ... [2022-12-13 18:44:55,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:44:54" (1/1) ... [2022-12-13 18:44:55,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:44:54" (1/1) ... [2022-12-13 18:44:55,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:44:54" (1/1) ... [2022-12-13 18:44:55,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:44:54" (1/1) ... [2022-12-13 18:44:55,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:44:54" (1/1) ... [2022-12-13 18:44:55,016 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:44:54" (1/1) ... [2022-12-13 18:44:55,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:44:54" (1/1) ... [2022-12-13 18:44:55,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:44:55,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:44:55,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:44:55,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:44:55,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:44:54" (1/1) ... [2022-12-13 18:44:55,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:44:55,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:44:55,048 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:44:55,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:44:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:44:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-12-13 18:44:55,081 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-12-13 18:44:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-12-13 18:44:55,082 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-12-13 18:44:55,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 18:44:55,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:44:55,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:44:55,139 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:44:55,141 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:44:55,261 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:44:55,266 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:44:55,266 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 18:44:55,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:44:55 BoogieIcfgContainer [2022-12-13 18:44:55,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:44:55,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:44:55,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:44:55,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:44:55,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:44:54" (1/3) ... [2022-12-13 18:44:55,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5644cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:44:55, skipping insertion in model container [2022-12-13 18:44:55,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:44:54" (2/3) ... [2022-12-13 18:44:55,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5644cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:44:55, skipping insertion in model container [2022-12-13 18:44:55,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:44:55" (3/3) ... [2022-12-13 18:44:55,274 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_2_3.i [2022-12-13 18:44:55,289 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:44:55,289 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 18:44:55,335 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:44:55,340 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;@9bb101, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:44:55,340 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 18:44:55,344 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-12-13 18:44:55,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 18:44:55,351 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:44:55,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:44:55,352 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:44:55,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:44:55,356 INFO L85 PathProgramCache]: Analyzing trace with hash -247750664, now seen corresponding path program 1 times [2022-12-13 18:44:55,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:44:55,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806176871] [2022-12-13 18:44:55,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:44:55,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:44:55,449 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 18:44:55,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2110854602] [2022-12-13 18:44:55,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:44:55,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:44:55,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:44:55,451 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:44:55,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 18:44:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:44:55,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 18:44:55,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:44:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:44:55,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:44:55,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:44:55,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806176871] [2022-12-13 18:44:55,533 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 18:44:55,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110854602] [2022-12-13 18:44:55,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110854602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:44:55,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:44:55,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:44:55,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177187809] [2022-12-13 18:44:55,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:44:55,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 18:44:55,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:44:55,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 18:44:55,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 18:44:55,562 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-12-13 18:44:55,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:44:55,579 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-12-13 18:44:55,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 18:44:55,580 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-12-13 18:44:55,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:44:55,585 INFO L225 Difference]: With dead ends: 66 [2022-12-13 18:44:55,585 INFO L226 Difference]: Without dead ends: 29 [2022-12-13 18:44:55,587 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-12-13 18:44:55,590 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-12-13 18:44:55,590 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-12-13 18:44:55,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-12-13 18:44:55,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-12-13 18:44:55,615 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-12-13 18:44:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-12-13 18:44:55,617 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 11 [2022-12-13 18:44:55,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:44:55,617 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-12-13 18:44:55,617 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-12-13 18:44:55,617 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-12-13 18:44:55,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 18:44:55,618 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:44:55,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:44:55,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 18:44:55,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-12-13 18:44:55,819 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:44:55,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:44:55,820 INFO L85 PathProgramCache]: Analyzing trace with hash -251444748, now seen corresponding path program 1 times [2022-12-13 18:44:55,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:44:55,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854840650] [2022-12-13 18:44:55,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:44:55,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:44:55,830 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 18:44:55,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [698151392] [2022-12-13 18:44:55,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:44:55,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:44:55,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:44:55,831 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:44:55,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 18:44:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:44:55,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 18:44:55,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:44:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:44:55,924 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:44:55,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:44:55,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854840650] [2022-12-13 18:44:55,924 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 18:44:55,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698151392] [2022-12-13 18:44:55,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698151392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:44:55,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:44:55,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:44:55,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629740170] [2022-12-13 18:44:55,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:44:55,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:44:55,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:44:55,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:44:55,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:44:55,926 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-12-13 18:44:55,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:44:55,937 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-12-13 18:44:55,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:44:55,938 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-12-13 18:44:55,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:44:55,938 INFO L225 Difference]: With dead ends: 36 [2022-12-13 18:44:55,938 INFO L226 Difference]: Without dead ends: 30 [2022-12-13 18:44:55,938 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-12-13 18:44:55,939 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-12-13 18:44:55,940 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-12-13 18:44:55,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-12-13 18:44:55,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-12-13 18:44:55,943 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-12-13 18:44:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-12-13 18:44:55,944 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-12-13 18:44:55,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:44:55,944 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-12-13 18:44:55,944 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-12-13 18:44:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-12-13 18:44:55,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 18:44:55,945 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:44:55,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:44:55,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 18:44:56,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-12-13 18:44:56,147 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:44:56,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:44:56,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1673157840, now seen corresponding path program 1 times [2022-12-13 18:44:56,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:44:56,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711004172] [2022-12-13 18:44:56,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:44:56,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:44:56,184 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 18:44:56,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1715833515] [2022-12-13 18:44:56,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:44:56,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:44:56,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:44:56,189 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:44:56,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 18:44:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:44:56,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 18:44:56,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:44:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:44:56,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:44:56,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:44:56,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:44:56,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711004172] [2022-12-13 18:44:56,335 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 18:44:56,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715833515] [2022-12-13 18:44:56,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715833515] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:44:56,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:44:56,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-12-13 18:44:56,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256452372] [2022-12-13 18:44:56,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:44:56,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:44:56,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:44:56,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:44:56,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:44:56,337 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-12-13 18:44:56,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:44:56,387 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-12-13 18:44:56,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:44:56,388 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-12-13 18:44:56,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:44:56,388 INFO L225 Difference]: With dead ends: 36 [2022-12-13 18:44:56,389 INFO L226 Difference]: Without dead ends: 31 [2022-12-13 18:44:56,389 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-12-13 18:44:56,389 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-12-13 18:44:56,390 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-12-13 18:44:56,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-13 18:44:56,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-12-13 18:44:56,393 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-12-13 18:44:56,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-12-13 18:44:56,393 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 12 [2022-12-13 18:44:56,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:44:56,394 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-12-13 18:44:56,394 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-12-13 18:44:56,394 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-12-13 18:44:56,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 18:44:56,394 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:44:56,394 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:44:56,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 18:44:56,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:44:56,597 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:44:56,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:44:56,598 INFO L85 PathProgramCache]: Analyzing trace with hash -276630798, now seen corresponding path program 2 times [2022-12-13 18:44:56,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:44:56,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744715499] [2022-12-13 18:44:56,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:44:56,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:44:56,628 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 18:44:56,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1401656524] [2022-12-13 18:44:56,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 18:44:56,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:44:56,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:44:56,633 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:44:56,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 18:45:06,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 18:45:06,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:45:06,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-13 18:45:06,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:47:16,829 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-12-13 18:47:37,892 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-12-13 18:47:58,239 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-12-13 18:48:19,077 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-12-13 18:48:21,080 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-12-13 18:48:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-13 18:48:38,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:52:26,952 WARN L233 SmtUtils]: Spent 2.77m 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-12-13 18:53:44,645 WARN L233 SmtUtils]: Spent 51.47s 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-12-13 18:55:03,964 WARN L233 SmtUtils]: Spent 25.46s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 18:55:51,015 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-12-13 18:55:53,018 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-12-13 18:56:09,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:56:09,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:56:09,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744715499] [2022-12-13 18:56:09,190 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 18:56:09,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401656524] [2022-12-13 18:56:09,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401656524] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:56:09,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:56:09,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 19 [2022-12-13 18:56:09,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112709036] [2022-12-13 18:56:09,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:56:09,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 18:56:09,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:56:09,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 18:56:09,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=135, Unknown=24, NotChecked=140, Total=342 [2022-12-13 18:56:09,193 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-12-13 18:56:57,453 WARN L233 SmtUtils]: Spent 42.20s 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-12-13 18:57:00,746 WARN L859 $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|) (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse6 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse5 (<= .cse6 127))) (and (let ((.cse4 (mod (+ .cse6 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse4 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) .cse5 (= .cse4 0))) (let ((.cse7 (mod (mod .cse6 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (not .cse5) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse7) 256) 0)) (= .cse7 0)))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) is different from true [2022-12-13 18:57:02,751 WARN L837 $PredicateComparison]: unable to prove that (and (or (let ((.cse12 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse13 (mod (+ .cse12 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse1 (<= .cse13 127)) (.cse9 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse8 (mod .cse12 256))) (let ((.cse0 (<= .cse8 127)) (.cse2 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse13)) 256) 0))) (.cse5 (= .cse13 0)) (.cse6 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse13) 256) 0))) (.cse3 (not .cse9)) (.cse7 (not .cse1))) (and (or .cse0 (let ((.cse4 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse8)) 256) 0)) .cse9))) (and (or .cse1 (and (or .cse2 .cse3) .cse4)) (or (and .cse4 (or .cse5 .cse6 .cse3)) .cse7)))) (or (not .cse0) (let ((.cse11 (or .cse9 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse8) 256) 0)) (= .cse8 0))) (.cse10 (= .cse12 0))) (and (or (and (or .cse10 .cse2 .cse3) .cse11) .cse1) (or (and .cse11 (or .cse10 .cse5 .cse6 .cse3)) .cse7))))))))) (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (< 0 |c_ULTIMATE.start_gcd_test_~b#1|) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse14 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (<= .cse14 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| .cse14) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse15 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (not (<= .cse15 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) .cse15) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))))) is different from false [2022-12-13 18:57:05,006 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-12-13 18:57:07,711 WARN L837 $PredicateComparison]: unable to prove that (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)) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse0 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (<= .cse0 127) (= (mod (mod .cse0 |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) (< 0 |c_ULTIMATE.start_gcd_test_~a#1|)) is different from false [2022-12-13 18:57:09,717 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-12-13 18:57:13,020 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-12-13 18:57:15,026 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-12-13 18:57:15,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:57:15,028 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-12-13 18:57:15,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 18:57:15,031 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-12-13 18:57:15,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:57:15,031 INFO L225 Difference]: With dead ends: 40 [2022-12-13 18:57:15,031 INFO L226 Difference]: Without dead ends: 35 [2022-12-13 18:57:15,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 395.0s TimeCoverageRelationStatistics Valid=59, Invalid=164, Unknown=31, NotChecked=396, Total=650 [2022-12-13 18:57:15,032 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-13 18:57:15,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 250 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 1 Unknown, 64 Unchecked, 2.8s Time] [2022-12-13 18:57:15,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-12-13 18:57:15,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-12-13 18:57:15,036 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-12-13 18:57:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-12-13 18:57:15,037 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 13 [2022-12-13 18:57:15,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:57:15,037 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-12-13 18:57:15,037 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-12-13 18:57:15,037 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-12-13 18:57:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 18:57:15,038 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:57:15,038 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:57:15,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 18:57:15,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:57:15,239 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:57:15,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:57:15,241 INFO L85 PathProgramCache]: Analyzing trace with hash 403427572, now seen corresponding path program 1 times [2022-12-13 18:57:15,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:57:15,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453821852] [2022-12-13 18:57:15,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:57:15,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:57:15,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 18:57:15,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1401913503] [2022-12-13 18:57:15,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:57:15,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:57:15,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:57:15,268 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:57:15,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_af49b622-a7c5-42cb-b8a4-08a1c6ce21ec/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 18:57:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:57:15,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 18:57:15,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:57:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:57:15,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 18:57:51,297 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-12-13 18:59:33,439 WARN L233 SmtUtils]: Spent 1.54m 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-12-13 18:59:33,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-13 18:59:33,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:59:33,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453821852] [2022-12-13 18:59:33,459 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 18:59:33,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401913503] [2022-12-13 18:59:33,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401913503] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 18:59:33,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 18:59:33,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2022-12-13 18:59:33,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769249710] [2022-12-13 18:59:33,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 18:59:33,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 18:59:33,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:59:33,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 18:59:33,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=37, Unknown=1, NotChecked=12, Total=72 [2022-12-13 18:59:33,460 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)