./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_1+newton_2_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_1+newton_2_5.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro --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 bef70c39331e78595b45dbc9116e80e68130a83e4d55fdf4189b866d036d57fe --- 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-8393723 [2022-11-18 21:09:03,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 21:09:03,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 21:09:03,759 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 21:09:03,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 21:09:03,765 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 21:09:03,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 21:09:03,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 21:09:03,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 21:09:03,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 21:09:03,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 21:09:03,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 21:09:03,788 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 21:09:03,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 21:09:03,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 21:09:03,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 21:09:03,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 21:09:03,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 21:09:03,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 21:09:03,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 21:09:03,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 21:09:03,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 21:09:03,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 21:09:03,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 21:09:03,823 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 21:09:03,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 21:09:03,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 21:09:03,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 21:09:03,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 21:09:03,827 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 21:09:03,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 21:09:03,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 21:09:03,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 21:09:03,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 21:09:03,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 21:09:03,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 21:09:03,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 21:09:03,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 21:09:03,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 21:09:03,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 21:09:03,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 21:09:03,840 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 21:09:03,884 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 21:09:03,884 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 21:09:03,885 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 21:09:03,885 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 21:09:03,886 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 21:09:03,887 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 21:09:03,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 21:09:03,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 21:09:03,888 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 21:09:03,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 21:09:03,889 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 21:09:03,890 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 21:09:03,890 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 21:09:03,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 21:09:03,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 21:09:03,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 21:09:03,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 21:09:03,891 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 21:09:03,891 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 21:09:03,891 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 21:09:03,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 21:09:03,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 21:09:03,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 21:09:03,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 21:09:03,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:09:03,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 21:09:03,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 21:09:03,895 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 21:09:03,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 21:09:03,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 21:09:03,896 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 21:09:03,896 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 21:09:03,896 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 21:09:03,896 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/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_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro 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 -> bef70c39331e78595b45dbc9116e80e68130a83e4d55fdf4189b866d036d57fe [2022-11-18 21:09:04,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 21:09:04,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 21:09:04,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 21:09:04,223 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 21:09:04,224 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 21:09:04,225 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/combinations/gcd_1+newton_2_5.i [2022-11-18 21:09:04,301 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/data/231190490/0f0b87b0c8e84fffa9ea2c39710986fb/FLAG9eb552325 [2022-11-18 21:09:04,765 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 21:09:04,766 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/sv-benchmarks/c/combinations/gcd_1+newton_2_5.i [2022-11-18 21:09:04,782 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/data/231190490/0f0b87b0c8e84fffa9ea2c39710986fb/FLAG9eb552325 [2022-11-18 21:09:05,135 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/data/231190490/0f0b87b0c8e84fffa9ea2c39710986fb [2022-11-18 21:09:05,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 21:09:05,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 21:09:05,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 21:09:05,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 21:09:05,147 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 21:09:05,148 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:09:05" (1/1) ... [2022-11-18 21:09:05,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c649e99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:05, skipping insertion in model container [2022-11-18 21:09:05,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:09:05" (1/1) ... [2022-11-18 21:09:05,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 21:09:05,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 21:09:05,425 WARN L234 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_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/sv-benchmarks/c/combinations/gcd_1+newton_2_5.i[1226,1239] [2022-11-18 21:09:05,468 WARN L234 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_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/sv-benchmarks/c/combinations/gcd_1+newton_2_5.i[2807,2820] [2022-11-18 21:09:05,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:09:05,489 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 21:09:05,500 WARN L234 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_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/sv-benchmarks/c/combinations/gcd_1+newton_2_5.i[1226,1239] [2022-11-18 21:09:05,511 WARN L234 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_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/sv-benchmarks/c/combinations/gcd_1+newton_2_5.i[2807,2820] [2022-11-18 21:09:05,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:09:05,528 INFO L208 MainTranslator]: Completed translation [2022-11-18 21:09:05,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:05 WrapperNode [2022-11-18 21:09:05,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 21:09:05,530 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 21:09:05,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 21:09:05,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 21:09:05,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:05" (1/1) ... [2022-11-18 21:09:05,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:05" (1/1) ... [2022-11-18 21:09:05,591 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2022-11-18 21:09:05,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 21:09:05,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 21:09:05,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 21:09:05,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 21:09:05,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:05" (1/1) ... [2022-11-18 21:09:05,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:05" (1/1) ... [2022-11-18 21:09:05,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:05" (1/1) ... [2022-11-18 21:09:05,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:05" (1/1) ... [2022-11-18 21:09:05,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:05" (1/1) ... [2022-11-18 21:09:05,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:05" (1/1) ... [2022-11-18 21:09:05,634 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:05" (1/1) ... [2022-11-18 21:09:05,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:05" (1/1) ... [2022-11-18 21:09:05,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 21:09:05,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 21:09:05,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 21:09:05,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 21:09:05,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:05" (1/1) ... [2022-11-18 21:09:05,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:09:05,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:09:05,695 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 21:09:05,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 21:09:05,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 21:09:05,756 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-18 21:09:05,756 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-18 21:09:05,757 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-18 21:09:05,757 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-18 21:09:05,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 21:09:05,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 21:09:05,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 21:09:05,826 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 21:09:05,829 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 21:09:06,079 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 21:09:06,084 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 21:09:06,095 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 21:09:06,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:09:06 BoogieIcfgContainer [2022-11-18 21:09:06,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 21:09:06,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 21:09:06,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 21:09:06,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 21:09:06,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:09:05" (1/3) ... [2022-11-18 21:09:06,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3821eb81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:09:06, skipping insertion in model container [2022-11-18 21:09:06,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:05" (2/3) ... [2022-11-18 21:09:06,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3821eb81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:09:06, skipping insertion in model container [2022-11-18 21:09:06,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:09:06" (3/3) ... [2022-11-18 21:09:06,106 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_2_5.i [2022-11-18 21:09:06,136 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 21:09:06,150 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 21:09:06,244 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 21:09:06,250 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;@5957dca2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 21:09:06,251 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-18 21:09:06,255 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-18 21:09:06,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 21:09:06,262 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:09:06,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:09:06,264 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:09:06,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:09:06,275 INFO L85 PathProgramCache]: Analyzing trace with hash -247750664, now seen corresponding path program 1 times [2022-11-18 21:09:06,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:09:06,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713164698] [2022-11-18 21:09:06,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:06,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:09:06,420 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 21:09:06,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [386060860] [2022-11-18 21:09:06,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:06,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:09:06,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:09:06,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:09:06,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 21:09:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:06,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 21:09:06,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:09:06,541 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-18 21:09:06,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:09:06,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:09:06,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713164698] [2022-11-18 21:09:06,543 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 21:09:06,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386060860] [2022-11-18 21:09:06,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386060860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:09:06,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:09:06,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 21:09:06,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886610092] [2022-11-18 21:09:06,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:09:06,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 21:09:06,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:09:06,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 21:09:06,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 21:09:06,588 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-18 21:09:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:09:06,619 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-11-18 21:09:06,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 21:09:06,622 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-18 21:09:06,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:09:06,629 INFO L225 Difference]: With dead ends: 66 [2022-11-18 21:09:06,630 INFO L226 Difference]: Without dead ends: 29 [2022-11-18 21:09:06,633 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-18 21:09:06,638 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-18 21:09:06,639 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-18 21:09:06,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-18 21:09:06,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-18 21:09:06,680 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-18 21:09:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-11-18 21:09:06,682 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 11 [2022-11-18 21:09:06,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:09:06,683 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-11-18 21:09:06,684 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-18 21:09:06,684 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-11-18 21:09:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 21:09:06,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:09:06,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:09:06,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 21:09:06,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:09:06,892 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:09:06,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:09:06,893 INFO L85 PathProgramCache]: Analyzing trace with hash -251444748, now seen corresponding path program 1 times [2022-11-18 21:09:06,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:09:06,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194800198] [2022-11-18 21:09:06,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:06,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:09:06,910 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 21:09:06,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1700936598] [2022-11-18 21:09:06,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:06,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:09:06,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:09:06,913 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:09:06,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 21:09:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:06,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 21:09:06,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:09:07,042 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-18 21:09:07,042 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:09:07,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:09:07,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194800198] [2022-11-18 21:09:07,043 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 21:09:07,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700936598] [2022-11-18 21:09:07,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700936598] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:09:07,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:09:07,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 21:09:07,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190886131] [2022-11-18 21:09:07,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:09:07,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 21:09:07,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:09:07,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 21:09:07,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:09:07,047 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-18 21:09:07,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:09:07,063 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-11-18 21:09:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 21:09:07,064 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-18 21:09:07,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:09:07,065 INFO L225 Difference]: With dead ends: 36 [2022-11-18 21:09:07,065 INFO L226 Difference]: Without dead ends: 30 [2022-11-18 21:09:07,065 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-18 21:09:07,067 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-18 21:09:07,068 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-18 21:09:07,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-18 21:09:07,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-18 21:09:07,074 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-18 21:09:07,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-18 21:09:07,075 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-11-18 21:09:07,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:09:07,075 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-18 21:09:07,076 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-18 21:09:07,076 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-18 21:09:07,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 21:09:07,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:09:07,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:09:07,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 21:09:07,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:09:07,287 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:09:07,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:09:07,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1673157840, now seen corresponding path program 1 times [2022-11-18 21:09:07,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:09:07,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490631417] [2022-11-18 21:09:07,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:07,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:09:07,313 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 21:09:07,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [921131611] [2022-11-18 21:09:07,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:07,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:09:07,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:09:07,321 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:09:07,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 21:09:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:07,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-18 21:09:07,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:09:07,484 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-18 21:09:07,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:09:07,518 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-18 21:09:07,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:09:07,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490631417] [2022-11-18 21:09:07,518 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 21:09:07,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921131611] [2022-11-18 21:09:07,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921131611] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:09:07,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 21:09:07,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-11-18 21:09:07,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602653787] [2022-11-18 21:09:07,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 21:09:07,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:09:07,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:09:07,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:09:07,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:09:07,522 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-18 21:09:07,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:09:07,615 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-11-18 21:09:07,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 21:09:07,616 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-18 21:09:07,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:09:07,617 INFO L225 Difference]: With dead ends: 36 [2022-11-18 21:09:07,617 INFO L226 Difference]: Without dead ends: 31 [2022-11-18 21:09:07,618 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-18 21:09:07,619 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.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:09:07,622 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.1s Time] [2022-11-18 21:09:07,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-18 21:09:07,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-18 21:09:07,627 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-18 21:09:07,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-11-18 21:09:07,628 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 12 [2022-11-18 21:09:07,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:09:07,629 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-11-18 21:09:07,629 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-18 21:09:07,629 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-11-18 21:09:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 21:09:07,630 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:09:07,630 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:09:07,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 21:09:07,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:09:07,839 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:09:07,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:09:07,841 INFO L85 PathProgramCache]: Analyzing trace with hash -276630798, now seen corresponding path program 2 times [2022-11-18 21:09:07,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:09:07,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922064217] [2022-11-18 21:09:07,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:07,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:09:07,866 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 21:09:07,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [571385915] [2022-11-18 21:09:07,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 21:09:07,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:09:07,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:09:07,878 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:09:07,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 21:09:18,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 21:09:18,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 21:09:18,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-18 21:09:18,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:10:09,395 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-18 21:10:28,982 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-18 21:10:50,989 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-18 21:11:10,152 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-18 21:11:12,159 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-18 21:11:29,028 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-18 21:11:29,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:12:23,724 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse27 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse28 (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse29 (mod (+ .cse27 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse9 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse13 (<= .cse29 127)) (.cse23 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0))) (.cse8 (not .cse18)) (.cse25 (= .cse28 0)) (.cse2 (<= .cse28 127)) (.cse17 (mod .cse27 256))) (let ((.cse19 (<= .cse17 127)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse29)) 256) 0))) (.cse3 (not .cse2)) (.cse15 (or .cse23 .cse8 .cse25)) (.cse6 (= .cse29 0)) (.cse7 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse29) 256) 0))) (.cse10 (not .cse13)) (.cse14 (not .cse9)) (.cse16 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0)))) (and (or (let ((.cse5 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse17)) 256) 0)) .cse18))) (let ((.cse1 (or .cse14 (and (or .cse16 .cse8) .cse5))) (.cse4 (or .cse14 (and .cse5 .cse15)))) (and (or (let ((.cse0 (or (and .cse5 (or .cse6 .cse7 .cse8)) .cse9))) (and (or (and .cse0 .cse1) .cse2) (or .cse3 (and .cse4 .cse0)))) .cse10) (or (let ((.cse11 (or .cse9 (and (or .cse12 .cse8) .cse5)))) (and (or (and .cse1 .cse11) .cse2) (or (and .cse4 .cse11) .cse3))) .cse13)))) .cse19) (or (not .cse19) (let ((.cse22 (or .cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse17) 256) 0)) (= .cse17 0))) (.cse24 (= .cse27 0))) (let ((.cse21 (or .cse14 (and .cse22 (or .cse24 .cse16 .cse8))))) (and (or (let ((.cse20 (or (and (or .cse24 .cse12 .cse8) .cse22) .cse9))) (and (or .cse2 (and .cse20 .cse21)) (or (and (or .cse14 (and .cse22 (or .cse23 .cse24 .cse8 .cse25))) .cse20) .cse3))) .cse13) (or (let ((.cse26 (or .cse9 (and .cse22 (or .cse24 .cse6 .cse7 .cse8))))) (and (or .cse3 (and (or .cse14 (and .cse22 .cse15)) .cse26)) (or (and .cse26 .cse21) .cse2))) .cse10)))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2022-11-18 21:12:45,364 WARN L859 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (let ((.cse11 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse14 (mod (+ .cse11 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse7 (mod .cse11 256)) (.cse1 (<= .cse14 127)) (.cse12 (= .cse14 0)) (.cse13 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse14) 256) 0))) (.cse3 (not .cse8))) (let ((.cse2 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse14)) 256) 0))) (.cse5 (or .cse12 .cse13 .cse3)) (.cse6 (not .cse1)) (.cse0 (<= .cse7 127))) (and (or .cse0 (let ((.cse4 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse7)) 256) 0)) .cse8))) (and (or .cse1 (and (or .cse2 .cse3) .cse4)) (or (and .cse4 .cse5) .cse6)))) (or (let ((.cse10 (or .cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 0)) (= .cse7 0))) (.cse9 (= .cse11 0))) (and (or (and (or .cse9 .cse2 .cse3) .cse10) .cse1) (or (and .cse10 (or (and .cse10 .cse5) (not (<= (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))) (or .cse9 .cse12 .cse13 .cse3)) .cse6))) (not .cse0)))))))) is different from true [2022-11-18 21:13:07,056 WARN L233 SmtUtils]: Spent 12.61s on a formula simplification. DAG size of input: 42 DAG size of output: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 21:13:24,694 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-18 21:14:12,897 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-18 21:14:14,901 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-18 21:14:31,713 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-18 21:14:31,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:14:31,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922064217] [2022-11-18 21:14:31,714 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-18 21:14:31,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571385915] [2022-11-18 21:14:31,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571385915] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:14:31,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 21:14:31,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 19 [2022-11-18 21:14:31,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383334862] [2022-11-18 21:14:31,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 21:14:31,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-18 21:14:31,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:14:31,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 21:14:31,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=88, Unknown=15, NotChecked=200, Total=342 [2022-11-18 21:14:31,717 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-18 21:15:26,873 WARN L233 SmtUtils]: Spent 47.72s 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-18 21:16:40,448 WARN L233 SmtUtils]: Spent 1.06m on a formula simplification. DAG size of input: 52 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 21:16:42,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-18 21:16:44,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-18 21:16:46,516 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (or (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (let ((.cse11 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse14 (mod (+ .cse11 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse7 (mod .cse11 256)) (.cse1 (<= .cse14 127)) (.cse12 (= .cse14 0)) (.cse13 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse14) 256) 0))) (.cse3 (not .cse8))) (let ((.cse2 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse14)) 256) 0))) (.cse5 (or .cse12 .cse13 .cse3)) (.cse6 (not .cse1)) (.cse0 (<= .cse7 127))) (and (or .cse0 (let ((.cse4 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse7)) 256) 0)) .cse8))) (and (or .cse1 (and (or .cse2 .cse3) .cse4)) (or (and .cse4 .cse5) .cse6)))) (or (let ((.cse10 (or .cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 0)) (= .cse7 0))) (.cse9 (= .cse11 0))) (and (or (and (or .cse9 .cse2 .cse3) .cse10) .cse1) (or (and .cse10 (or (and .cse10 .cse5) (not (<= (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))) (or .cse9 .cse12 .cse13 .cse3)) .cse6))) (not .cse0)))))))) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (< 0 |c_ULTIMATE.start_gcd_test_~b#1|) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse15 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (<= .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| .cse15) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse16 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (not (<= .cse16 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) .cse16) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))))) is different from false [2022-11-18 21:16:49,514 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (or (let ((.cse27 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse28 (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse29 (mod (+ .cse27 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse9 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse13 (<= .cse29 127)) (.cse23 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0))) (.cse8 (not .cse18)) (.cse25 (= .cse28 0)) (.cse2 (<= .cse28 127)) (.cse17 (mod .cse27 256))) (let ((.cse19 (<= .cse17 127)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse29)) 256) 0))) (.cse3 (not .cse2)) (.cse15 (or .cse23 .cse8 .cse25)) (.cse6 (= .cse29 0)) (.cse7 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse29) 256) 0))) (.cse10 (not .cse13)) (.cse14 (not .cse9)) (.cse16 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0)))) (and (or (let ((.cse5 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse17)) 256) 0)) .cse18))) (let ((.cse1 (or .cse14 (and (or .cse16 .cse8) .cse5))) (.cse4 (or .cse14 (and .cse5 .cse15)))) (and (or (let ((.cse0 (or (and .cse5 (or .cse6 .cse7 .cse8)) .cse9))) (and (or (and .cse0 .cse1) .cse2) (or .cse3 (and .cse4 .cse0)))) .cse10) (or (let ((.cse11 (or .cse9 (and (or .cse12 .cse8) .cse5)))) (and (or (and .cse1 .cse11) .cse2) (or (and .cse4 .cse11) .cse3))) .cse13)))) .cse19) (or (not .cse19) (let ((.cse22 (or .cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse17) 256) 0)) (= .cse17 0))) (.cse24 (= .cse27 0))) (let ((.cse21 (or .cse14 (and .cse22 (or .cse24 .cse16 .cse8))))) (and (or (let ((.cse20 (or (and (or .cse24 .cse12 .cse8) .cse22) .cse9))) (and (or .cse2 (and .cse20 .cse21)) (or (and (or .cse14 (and .cse22 (or .cse23 .cse24 .cse8 .cse25))) .cse20) .cse3))) .cse13) (or (let ((.cse26 (or .cse9 (and .cse22 (or .cse24 .cse6 .cse7 .cse8))))) (and (or .cse3 (and (or .cse14 (and .cse22 .cse15)) .cse26)) (or (and .cse26 .cse21) .cse2))) .cse10)))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (< 0 |c_ULTIMATE.start_gcd_test_~b#1|) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse30 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (<= .cse30 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse30) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse31 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (not (<= .cse31 127)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse31) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))))) is different from false [2022-11-18 21:17:35,775 WARN L233 SmtUtils]: Spent 38.98s 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-18 21:18:10,394 WARN L233 SmtUtils]: Spent 26.17s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 21:18:12,406 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-18 21:18:14,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-18 21:18:40,461 WARN L233 SmtUtils]: Spent 23.78s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 21:19:16,037 WARN L233 SmtUtils]: Spent 29.33s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 21:19:18,178 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 128))) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 256) 0)) (not (<= |c_ULTIMATE.start_gcd_test_~b#1| 127)) .cse0) (or (not (<= |c_ULTIMATE.start_gcd_test_#res#1| 127)) (not (<= 0 (+ 128 |c_ULTIMATE.start_gcd_test_#res#1|)))) (or (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)))) (or (let ((.cse3 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse1 (<= .cse3 127))) (and (let ((.cse2 (mod (mod .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse1) (= 0 .cse2) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse2) 256) 0)))) (let ((.cse4 (mod (+ .cse3 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse4 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) 256) 0)) .cse1 (= .cse4 0)))))) (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) .cse0))) is different from true [2022-11-18 21:19:18,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:19:18,709 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-11-18 21:19:18,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 21:19:18,710 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-18 21:19:18,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:19:18,711 INFO L225 Difference]: With dead ends: 43 [2022-11-18 21:19:18,711 INFO L226 Difference]: Without dead ends: 36 [2022-11-18 21:19:18,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 329.5s TimeCoverageRelationStatistics Valid=79, Invalid=214, Unknown=27, NotChecked=492, Total=812 [2022-11-18 21:19:18,713 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-11-18 21:19:18,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 186 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 3 Unknown, 216 Unchecked, 6.9s Time] [2022-11-18 21:19:18,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-18 21:19:18,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-11-18 21:19:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-18 21:19:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-18 21:19:18,723 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 13 [2022-11-18 21:19:18,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:19:18,723 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-18 21:19:18,723 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-18 21:19:18,724 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-18 21:19:18,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-18 21:19:18,724 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:19:18,724 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:19:18,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 21:19:18,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:19:18,925 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:19:18,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:19:18,926 INFO L85 PathProgramCache]: Analyzing trace with hash 66034544, now seen corresponding path program 3 times [2022-11-18 21:19:18,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:19:18,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022551228] [2022-11-18 21:19:18,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:19:18,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:19:18,936 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-18 21:19:18,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [815559571] [2022-11-18 21:19:18,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 21:19:18,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:19:18,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:19:18,938 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:19:18,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38bfedf0-c578-4fdf-ab3b-7356cd7fb085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 21:19:38,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-18 21:19:38,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 21:19:38,228 WARN L261 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-18 21:19:38,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:20:21,115 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_19|) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_19|)) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse0) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_19| 0) (not (= .cse0 0))))) (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) is different from false [2022-11-18 21:20:47,317 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse1 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_19|) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse0 (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse1) 256))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_19|)) (not (= .cse0 0)) (= (mod (mod .cse1 .cse0) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse0) (< |v_ULTIMATE.start_gcd_test_~a#1_19| 0) (not (= .cse1 0)))))) (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) is different from false [2022-11-18 21:21:10,052 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_19|) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse1 (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse0) 256))) (and (= (mod (mod .cse0 .cse1) 256) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_19|)) (not (= .cse1 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse1) (< |v_ULTIMATE.start_gcd_test_~a#1_19| 0) (not (= .cse0 0)))))) (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) is different from false [2022-11-18 21:21:35,221 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_19|) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse1 (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse0) 256))) (and (= (mod (mod .cse0 .cse1) 256) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_19|)) (not (= .cse1 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= .cse1 |c_ULTIMATE.start_gcd_test_#res#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_19| 0) (not (= .cse0 0)))))) (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) is different from false [2022-11-18 21:22:10,744 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main1_~y~0#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_19|) 256) |ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse1 (mod (mod |ULTIMATE.start_main1_~y~0#1| .cse0) 256))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_19|)) (< 0 |ULTIMATE.start_main1_~y~0#1|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |ULTIMATE.start_main1_~y~0#1|) 0) (not (= .cse0 0)) (not (= 0 .cse1)) (= (mod (mod .cse0 .cse1) 256) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_19| 0))))) (<= 0 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|)) is different from false [2022-11-18 21:22:35,440 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main1_~y~0#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_19|) 256) |ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse1 (mod (mod |ULTIMATE.start_main1_~y~0#1| .cse0) 256))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_19|)) (< 0 |ULTIMATE.start_main1_~y~0#1|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |ULTIMATE.start_main1_~y~0#1|) 0) (not (= .cse0 0)) (not (= 0 .cse1)) (= (mod (mod .cse0 .cse1) 256) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_19| 0))))) is different from false [2022-11-18 21:22:37,443 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main1_~y~0#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_19|) 256) |ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse1 (mod (mod |ULTIMATE.start_main1_~y~0#1| .cse0) 256))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_19|)) (< 0 |ULTIMATE.start_main1_~y~0#1|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |ULTIMATE.start_main1_~y~0#1|) 0) (not (= .cse0 0)) (not (= 0 .cse1)) (= (mod (mod .cse0 .cse1) 256) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_19| 0))))) is different from true [2022-11-18 21:22:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-18 21:22:37,443 INFO L328 TraceCheckSpWp]: Computing backward predicates...