./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_3+newton_2_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_5.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN --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 b041289a049a7233b2a378ca6fc5bbde9d5c291c849eb6ce585cee09751124ba --- 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-6b4ec56 [2022-11-20 11:38:00,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:38:00,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:38:00,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:38:00,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:38:00,936 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:38:00,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:38:00,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:38:00,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:38:00,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:38:00,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:38:00,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:38:00,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:38:00,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:38:00,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:38:00,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:38:00,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:38:00,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:38:00,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:38:00,980 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:38:00,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:38:00,985 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:38:00,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:38:00,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:38:01,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:38:01,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:38:01,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:38:01,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:38:01,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:38:01,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:38:01,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:38:01,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:38:01,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:38:01,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:38:01,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:38:01,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:38:01,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:38:01,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:38:01,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:38:01,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:38:01,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:38:01,020 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 11:38:01,080 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:38:01,081 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:38:01,081 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:38:01,081 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:38:01,082 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:38:01,082 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:38:01,083 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:38:01,083 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:38:01,084 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:38:01,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:38:01,085 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:38:01,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:38:01,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:38:01,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:38:01,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:38:01,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:38:01,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:38:01,087 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:38:01,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:38:01,087 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:38:01,087 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:38:01,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:38:01,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:38:01,088 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:38:01,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:38:01,089 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:38:01,089 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:38:01,089 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:38:01,090 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:38:01,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:38:01,090 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:38:01,091 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:38:01,091 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:38:01,091 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_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/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_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN 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 -> b041289a049a7233b2a378ca6fc5bbde9d5c291c849eb6ce585cee09751124ba [2022-11-20 11:38:01,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:38:01,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:38:01,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:38:01,442 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:38:01,443 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:38:01,444 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/combinations/gcd_3+newton_2_5.i [2022-11-20 11:38:04,699 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:38:04,920 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:38:04,921 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i [2022-11-20 11:38:04,930 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/data/893a2b591/a0b2fa7f76cc4b10ae964801a7e862ef/FLAGfdb91a33e [2022-11-20 11:38:04,989 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/data/893a2b591/a0b2fa7f76cc4b10ae964801a7e862ef [2022-11-20 11:38:04,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:38:05,009 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:38:05,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:38:05,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:38:05,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:38:05,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:38:04" (1/1) ... [2022-11-20 11:38:05,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ceb3c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:05, skipping insertion in model container [2022-11-20 11:38:05,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:38:04" (1/1) ... [2022-11-20 11:38:05,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:38:05,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:38:05,345 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[1226,1239] [2022-11-20 11:38:05,395 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[2841,2854] [2022-11-20 11:38:05,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:38:05,424 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:38:05,450 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[1226,1239] [2022-11-20 11:38:05,469 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[2841,2854] [2022-11-20 11:38:05,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:38:05,493 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:38:05,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:05 WrapperNode [2022-11-20 11:38:05,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:38:05,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:38:05,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:38:05,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:38:05,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:05" (1/1) ... [2022-11-20 11:38:05,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:05" (1/1) ... [2022-11-20 11:38:05,570 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2022-11-20 11:38:05,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:38:05,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:38:05,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:38:05,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:38:05,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:05" (1/1) ... [2022-11-20 11:38:05,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:05" (1/1) ... [2022-11-20 11:38:05,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:05" (1/1) ... [2022-11-20 11:38:05,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:05" (1/1) ... [2022-11-20 11:38:05,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:05" (1/1) ... [2022-11-20 11:38:05,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:05" (1/1) ... [2022-11-20 11:38:05,618 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:05" (1/1) ... [2022-11-20 11:38:05,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:05" (1/1) ... [2022-11-20 11:38:05,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:38:05,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:38:05,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:38:05,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:38:05,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:05" (1/1) ... [2022-11-20 11:38:05,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:38:05,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:38:05,676 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:38:05,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:38:05,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:38:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-20 11:38:05,734 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-20 11:38:05,734 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-20 11:38:05,737 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-20 11:38:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:38:05,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:38:05,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:38:05,841 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:38:05,844 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:38:06,093 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:38:06,101 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:38:06,101 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 11:38:06,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:38:06 BoogieIcfgContainer [2022-11-20 11:38:06,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:38:06,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:38:06,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:38:06,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:38:06,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:38:04" (1/3) ... [2022-11-20 11:38:06,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465c831e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:38:06, skipping insertion in model container [2022-11-20 11:38:06,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:38:05" (2/3) ... [2022-11-20 11:38:06,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465c831e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:38:06, skipping insertion in model container [2022-11-20 11:38:06,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:38:06" (3/3) ... [2022-11-20 11:38:06,114 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_5.i [2022-11-20 11:38:06,137 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:38:06,137 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 11:38:06,211 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:38:06,229 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;@109df405, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:38:06,229 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-20 11:38:06,244 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-20 11:38:06,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:38:06,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:06,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:38:06,263 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:38:06,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:06,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-11-20 11:38:06,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:06,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236961124] [2022-11-20 11:38:06,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:06,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:06,674 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-20 11:38:06,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:06,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236961124] [2022-11-20 11:38:06,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236961124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:06,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:06,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:38:06,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459626730] [2022-11-20 11:38:06,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:06,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:38:06,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:06,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:38:06,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:38:06,730 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 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-20 11:38:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:06,811 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2022-11-20 11:38:06,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:38:06,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-20 11:38:06,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:06,832 INFO L225 Difference]: With dead ends: 90 [2022-11-20 11:38:06,836 INFO L226 Difference]: Without dead ends: 36 [2022-11-20 11:38:06,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:38:06,852 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:06,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 119 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:38:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-20 11:38:06,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-11-20 11:38:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 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-20 11:38:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-11-20 11:38:06,918 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2022-11-20 11:38:06,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:06,919 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-11-20 11:38:06,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-20 11:38:06,920 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-11-20 11:38:06,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:38:06,921 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:06,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:38:06,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:38:06,922 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:38:06,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:06,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1776235347, now seen corresponding path program 1 times [2022-11-20 11:38:06,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:06,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333414601] [2022-11-20 11:38:06,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:06,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:07,295 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-20 11:38:07,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:07,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333414601] [2022-11-20 11:38:07,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333414601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:38:07,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:38:07,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:38:07,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849859537] [2022-11-20 11:38:07,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:38:07,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:38:07,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:07,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:38:07,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:38:07,331 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-20 11:38:07,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:07,465 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-11-20 11:38:07,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:38:07,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-20 11:38:07,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:07,471 INFO L225 Difference]: With dead ends: 36 [2022-11-20 11:38:07,471 INFO L226 Difference]: Without dead ends: 30 [2022-11-20 11:38:07,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:38:07,474 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:07,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 130 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:38:07,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-20 11:38:07,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-20 11:38:07,481 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-20 11:38:07,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-20 11:38:07,482 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-11-20 11:38:07,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:07,485 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-20 11:38:07,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-20 11:38:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-20 11:38:07,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 11:38:07,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:07,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:38:07,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:38:07,488 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:38:07,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:07,489 INFO L85 PathProgramCache]: Analyzing trace with hash 830014046, now seen corresponding path program 1 times [2022-11-20 11:38:07,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:07,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683648737] [2022-11-20 11:38:07,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:07,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:07,507 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:38:07,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [272671240] [2022-11-20 11:38:07,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:07,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:38:07,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:38:07,513 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:38:07,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:38:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:38:07,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-20 11:38:07,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:38:08,406 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-20 11:38:08,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:38:29,280 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-20 11:38:29,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:38:29,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683648737] [2022-11-20 11:38:29,281 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:38:29,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272671240] [2022-11-20 11:38:29,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272671240] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:38:29,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:38:29,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-11-20 11:38:29,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626001321] [2022-11-20 11:38:29,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:38:29,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 11:38:29,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:38:29,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 11:38:29,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=183, Unknown=9, NotChecked=0, Total=240 [2022-11-20 11:38:29,285 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-20 11:38:35,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:38:35,006 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-11-20 11:38:35,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 11:38:35,007 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-20 11:38:35,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:38:35,008 INFO L225 Difference]: With dead ends: 42 [2022-11-20 11:38:35,008 INFO L226 Difference]: Without dead ends: 32 [2022-11-20 11:38:35,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=96, Invalid=313, Unknown=11, NotChecked=0, Total=420 [2022-11-20 11:38:35,011 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:38:35,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 255 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 9 Unchecked, 0.3s Time] [2022-11-20 11:38:35,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-20 11:38:35,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-20 11:38:35,016 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-20 11:38:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-20 11:38:35,018 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 12 [2022-11-20 11:38:35,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:38:35,018 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-20 11:38:35,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-20 11:38:35,019 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-20 11:38:35,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:38:35,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:38:35,020 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:38:35,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 11:38:35,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:38:35,223 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:38:35,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:38:35,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1518646018, now seen corresponding path program 2 times [2022-11-20 11:38:35,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:38:35,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645626054] [2022-11-20 11:38:35,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:38:35,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:38:35,235 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 11:38:35,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [930918126] [2022-11-20 11:38:35,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:38:35,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:38:35,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:38:35,237 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:38:35,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:38:35,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:38:35,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:38:35,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-20 11:38:35,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:39:14,829 WARN L233 SmtUtils]: Spent 19.51s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:39:35,948 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse4 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse1 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse3 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse1)))) (let ((.cse0 (mod .cse3 256))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse0))) (and (not (= .cse0 0)) (not (<= .cse1 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse1) (<= (mod (+ .cse2 .cse3) 256) 127) (not (= .cse2 0)) (= .cse4 (mod (+ .cse2 (* 255 .cse3)) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |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)))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse5 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse7 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse5))) (let ((.cse8 (mod .cse7 256))) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse8))) (and (not (= 0 .cse5)) (= .cse4 (mod (+ .cse6 (* 255 .cse7)) 256)) (not (= .cse8 0)) (not (<= (mod (+ .cse6 .cse7) 256) 127)) (<= .cse5 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse9 0) (<= .cse8 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse9 256))))))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse10 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse12 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse10))) (let ((.cse13 (mod .cse12 256))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse13))) (and (not (= 0 .cse10)) (= .cse4 (mod (+ .cse11 (* 255 .cse12)) 256)) (not (= .cse13 0)) (<= (mod (+ .cse11 .cse12) 256) 127) (<= .cse10 127) (not (= .cse11 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse14 0) (<= .cse13 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse14 256))))))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse16 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse18 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse16)))) (let ((.cse15 (mod .cse18 256))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse15))) (and (not (= .cse15 0)) (not (<= .cse16 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse16) (not (<= (mod (+ .cse17 .cse18) 256) 127)) (= .cse4 (mod (+ .cse17 (* 255 .cse18)) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse15 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |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)))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse19 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse21 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse19))) (let ((.cse22 (mod .cse21 256))) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse22))) (and (not (= 0 .cse19)) (= .cse4 (mod (+ .cse20 (* 255 .cse21)) 256)) (not (= .cse22 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse22 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |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)))) (<= (mod (+ .cse20 .cse21) 256) 127) (<= .cse19 127) (not (= .cse20 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse24 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse26 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse24)))) (let ((.cse23 (mod .cse26 256))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse23))) (and (not (= .cse23 0)) (not (<= .cse24 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse24) (<= (mod (+ .cse25 .cse26) 256) 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse27 0) (<= .cse23 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse27 256))))) (not (= .cse25 0)) (= .cse4 (mod (+ .cse25 (* 255 .cse26)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse28 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse30 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse28))) (let ((.cse31 (mod .cse30 256))) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse31))) (and (not (= 0 .cse28)) (= .cse4 (mod (+ .cse29 (* 255 .cse30)) 256)) (not (= .cse31 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse31 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |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)))) (not (<= (mod (+ .cse29 .cse30) 256) 127)) (<= .cse28 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse33 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse35 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse33)))) (let ((.cse32 (mod .cse35 256))) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse32))) (and (not (= .cse32 0)) (not (<= .cse33 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse33) (not (<= (mod (+ .cse34 .cse35) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse36 0) (<= .cse32 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse36 256))))) (= .cse4 (mod (+ .cse34 (* 255 .cse35)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse37 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse38 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse37) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse37) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse38) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse38 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse38 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |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)))) (<= .cse37 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse39 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse40 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse39) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse39) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse40) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse40 0)) (<= .cse39 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse41 0) (<= .cse40 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse41 256))))))))))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0))) is different from false [2022-11-20 11:39:44,837 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse1 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse0 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse3 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse0))) (let ((.cse4 (mod .cse3 256))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse4))) (and (not (= 0 .cse0)) (= .cse1 (mod (+ .cse2 (* 255 .cse3)) 256)) (not (= .cse4 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0))) (not (<= (mod (+ .cse2 .cse3) 256) 127)) (<= .cse0 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse6 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse8 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse6)))) (let ((.cse5 (mod .cse8 256))) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse5))) (and (not (= .cse5 0)) (not (<= .cse6 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse6) (<= (mod (+ .cse7 .cse8) 256) 127) (not (= .cse7 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0))) (= .cse1 (mod (+ .cse7 (* 255 .cse8)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse10 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse9 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse10) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse10) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse9) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse9 0)) (<= .cse10 127))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse11 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse12 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse11) 256))) (and (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse11) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse12) 256) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse12 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse12 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0))) (<= .cse11 127))))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse14 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse16 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse14))) (let ((.cse13 (mod .cse16 256))) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse13))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse13 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (not (= 0 .cse14)) (= .cse1 (mod (+ .cse15 (* 255 .cse16)) 256)) (not (= .cse13 0)) (<= (mod (+ .cse15 .cse16) 256) 127) (<= .cse14 127) (not (= .cse15 0)))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse18 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse20 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse18))) (let ((.cse17 (mod .cse20 256))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse17))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse17 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (not (= 0 .cse18)) (= .cse1 (mod (+ .cse19 (* 255 .cse20)) 256)) (not (= .cse17 0)) (not (<= (mod (+ .cse19 .cse20) 256) 127)) (<= .cse18 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse22 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse24 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse22)))) (let ((.cse21 (mod .cse24 256))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse21))) (and (not (= .cse21 0)) (not (<= .cse22 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse22) (<= (mod (+ .cse23 .cse24) 256) 127) (not (= .cse23 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse21 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (= .cse1 (mod (+ .cse23 (* 255 .cse24)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse26 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse26)))) (let ((.cse25 (mod .cse28 256))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse25))) (and (not (= .cse25 0)) (not (<= .cse26 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse26) (not (<= (mod (+ .cse27 .cse28) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse25 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0))) (= .cse1 (mod (+ .cse27 (* 255 .cse28)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse29 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse31 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse29))) (let ((.cse32 (mod .cse31 256))) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse32))) (and (not (= 0 .cse29)) (= .cse1 (mod (+ .cse30 (* 255 .cse31)) 256)) (not (= .cse32 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse32 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0))) (<= (mod (+ .cse30 .cse31) 256) 127) (<= .cse29 127) (not (= .cse30 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse34 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse36 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse34)))) (let ((.cse33 (mod .cse36 256))) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse33))) (and (not (= .cse33 0)) (not (<= .cse34 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse34) (not (<= (mod (+ .cse35 .cse36) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse33 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (= .cse1 (mod (+ .cse35 (* 255 .cse36)) 256)))))))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0))) is different from false [2022-11-20 11:39:52,607 WARN L837 $PredicateComparison]: unable to prove that (and (not (= 0 |c_ULTIMATE.start_gcd_test_#res#1|)) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0)) (let ((.cse4 (+ 256 |c_ULTIMATE.start_gcd_test_#res#1|))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse1 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse3 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse1)))) (let ((.cse0 (mod .cse3 256))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse0))) (and (not (= .cse0 0)) (not (<= .cse1 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse1) (<= (mod (+ .cse2 .cse3) 256) 127) (not (= .cse2 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (= .cse4 (mod (+ .cse2 (* 255 .cse3)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse6 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse8 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse6))) (let ((.cse5 (mod .cse8 256))) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse5))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (not (= 0 .cse6)) (not (= .cse5 0)) (= .cse4 (mod (+ .cse7 (* 255 .cse8)) 256)) (<= (mod (+ .cse7 .cse8) 256) 127) (<= .cse6 127) (not (= .cse7 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse10 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse9 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse10) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse10) (not (= .cse9 0)) (<= .cse10 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse9) 256) |c_ULTIMATE.start_gcd_test_#res#1|))))) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse12 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse14 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse12)))) (let ((.cse11 (mod .cse14 256))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse11))) (and (not (= .cse11 0)) (not (<= .cse12 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse11 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse12) (<= (mod (+ .cse13 .cse14) 256) 127) (not (= .cse13 0)) (= .cse4 (mod (+ .cse13 (* 255 .cse14)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse16 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse18 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse16))) (let ((.cse15 (mod .cse18 256))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse15))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= .cse15 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (not (= 0 .cse16)) (not (= .cse15 0)) (= .cse4 (mod (+ .cse17 (* 255 .cse18)) 256)) (not (<= (mod (+ .cse17 .cse18) 256) 127)) (<= .cse16 127))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse20 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse22 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse20)))) (let ((.cse19 (mod .cse22 256))) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse19))) (and (not (= .cse19 0)) (not (<= .cse20 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse19 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse20) (not (<= (mod (+ .cse21 .cse22) 256) 127)) (= .cse4 (mod (+ .cse21 (* 255 .cse22)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse24 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse26 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse24))) (let ((.cse23 (mod .cse26 256))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse23))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse23 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (not (= 0 .cse24)) (not (= .cse23 0)) (= .cse4 (mod (+ .cse25 (* 255 .cse26)) 256)) (<= (mod (+ .cse25 .cse26) 256) 127) (<= .cse24 127) (not (= .cse25 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse28 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse27 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse28) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= .cse27 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse28) (not (= .cse27 0)) (<= .cse28 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse27) 256) |c_ULTIMATE.start_gcd_test_#res#1|))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse30 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse32 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse30)))) (let ((.cse29 (mod .cse32 256))) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse29))) (and (not (= .cse29 0)) (not (<= .cse30 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse30) (not (<= (mod (+ .cse31 .cse32) 256) 127)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 256) 0) (<= .cse29 |v_ULTIMATE.start_gcd_test_~a#1_14|))) (= .cse4 (mod (+ .cse31 (* 255 .cse32)) 256)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (and (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int)) (let ((.cse34 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse36 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse34))) (let ((.cse33 (mod .cse36 256))) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse33))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (<= .cse33 |v_ULTIMATE.start_gcd_test_~a#1_14|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (not (= 0 .cse34)) (not (= .cse33 0)) (= .cse4 (mod (+ .cse35 (* 255 .cse36)) 256)) (not (<= (mod (+ .cse35 .cse36) 256) 127)) (<= .cse34 127)))))))))))) is different from false [2022-11-20 11:40:04,187 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse5 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|))) (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse1 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse4 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse1))) (let ((.cse0 (mod .cse4 256))) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse0))) (let ((.cse2 (mod (+ .cse3 (* 255 .cse4)) 256))) (and (<= .cse0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= 0 .cse1)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse2)) 256) 0) (not (= .cse0 0)) (not (<= (mod (+ .cse3 .cse4) 256) 127)) (<= .cse1 127) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (<= .cse5 .cse2)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse7 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse6 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse7) 256))) (let ((.cse8 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse6) 256))) (and (<= .cse6 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse7) (not (= .cse8 0)) (not (= .cse6 0)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse8) (<= .cse7 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse8) 0)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse11 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse13 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse11)))) (let ((.cse9 (mod .cse13 256))) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse9))) (let ((.cse10 (mod (+ .cse12 (* 255 .cse13)) 256))) (and (not (= .cse9 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse10)) 256) 0) (not (<= .cse11 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse11) (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (<= (mod (+ .cse12 .cse13) 256) 127)) (<= .cse5 .cse10)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse15 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse17 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse15)))) (let ((.cse14 (mod .cse17 256))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse14))) (let ((.cse18 (mod (+ .cse16 (* 255 .cse17)) 256))) (and (not (= .cse14 0)) (not (<= .cse15 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse15) (<= (mod (+ .cse16 .cse17) 256) 127) (<= .cse14 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= .cse16 0)) (<= .cse5 .cse18) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse18)) 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse21 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse23 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse21)))) (let ((.cse19 (mod .cse23 256))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse19))) (let ((.cse20 (mod (+ .cse22 (* 255 .cse23)) 256))) (and (not (= .cse19 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse20)) 256) 0) (not (<= .cse21 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse21) (<= (mod (+ .cse22 .cse23) 256) 127) (<= .cse19 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= .cse22 0)) (<= .cse5 .cse20)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse25 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse28 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse25))) (let ((.cse24 (mod .cse28 256))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse24))) (let ((.cse26 (mod (+ .cse27 (* 255 .cse28)) 256))) (and (<= .cse24 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= 0 .cse25)) (not (= .cse24 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse26)) 0) (<= (mod (+ .cse27 .cse28) 256) 127) (<= .cse25 127) (not (= .cse27 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (<= .cse5 .cse26)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse30 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse32 (mod |c_ULTIMATE.start_main1_~x~0#1| (+ (- 256) .cse30)))) (let ((.cse29 (mod .cse32 256))) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse29))) (let ((.cse33 (mod (+ .cse31 (* 255 .cse32)) 256))) (and (not (= .cse29 0)) (not (<= .cse30 127)) (<= (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_13|) .cse30) (<= .cse29 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (<= (mod (+ .cse31 .cse32) 256) 127)) (<= .cse5 .cse33) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse33)) 0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse35 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse34 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse35) 256))) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse34) 256))) (and (<= .cse34 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= |v_ULTIMATE.start_gcd_test_~a#1_13| .cse35) (not (= .cse36 0)) (not (= .cse34 0)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse36) 256) 0) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (<= |c_ULTIMATE.start_main1_~g~0#1| .cse36) (<= .cse35 127)))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse38 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse41 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse38))) (let ((.cse37 (mod .cse41 256))) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse37))) (let ((.cse39 (mod (+ .cse40 (* 255 .cse41)) 256))) (and (<= .cse37 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= 0 .cse38)) (not (= .cse37 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse39)) 0) (not (<= (mod (+ .cse40 .cse41) 256) 127)) (<= .cse38 127) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (<= .cse5 .cse39)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_13| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse43 (mod (* 255 |v_ULTIMATE.start_gcd_test_~b#1_13|) 256))) (let ((.cse46 (mod |c_ULTIMATE.start_main1_~x~0#1| .cse43))) (let ((.cse42 (mod .cse46 256))) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| .cse42))) (let ((.cse44 (mod (+ .cse45 (* 255 .cse46)) 256))) (and (<= .cse42 |v_ULTIMATE.start_gcd_test_~a#1_14|) (not (= 0 .cse43)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| (+ (- 256) .cse44)) 256) 0) (not (= .cse42 0)) (<= (mod (+ .cse45 .cse46) 256) 127) (<= .cse43 127) (not (= .cse45 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (<= .cse5 .cse44)))))))))) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0))) is different from false [2022-11-20 11:40:15,892 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 11:40:15,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:41:04,353 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 139 [2022-11-20 11:41:04,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:41:04,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645626054] [2022-11-20 11:41:04,355 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 11:41:04,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930918126] [2022-11-20 11:41:04,355 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-20 11:41:04,368 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-20 11:41:04,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:41:04,556 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:625) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:306) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 52 more [2022-11-20 11:41:04,561 INFO L158 Benchmark]: Toolchain (without parser) took 179552.04ms. Allocated memory was 199.2MB in the beginning and 245.4MB in the end (delta: 46.1MB). Free memory was 171.5MB in the beginning and 157.5MB in the end (delta: 14.0MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. [2022-11-20 11:41:04,561 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 130.0MB. Free memory was 98.2MB in the beginning and 98.1MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:41:04,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.74ms. Allocated memory is still 199.2MB. Free memory was 171.1MB in the beginning and 160.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 11:41:04,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.57ms. Allocated memory is still 199.2MB. Free memory was 160.0MB in the beginning and 158.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:41:04,565 INFO L158 Benchmark]: Boogie Preprocessor took 62.62ms. Allocated memory is still 199.2MB. Free memory was 158.0MB in the beginning and 156.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:41:04,566 INFO L158 Benchmark]: RCFGBuilder took 468.85ms. Allocated memory is still 199.2MB. Free memory was 156.7MB in the beginning and 144.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 11:41:04,566 INFO L158 Benchmark]: TraceAbstraction took 178453.20ms. Allocated memory was 199.2MB in the beginning and 245.4MB in the end (delta: 46.1MB). Free memory was 143.3MB in the beginning and 157.5MB in the end (delta: -14.3MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2022-11-20 11:41:04,568 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 130.0MB. Free memory was 98.2MB in the beginning and 98.1MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.74ms. Allocated memory is still 199.2MB. Free memory was 171.1MB in the beginning and 160.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.57ms. Allocated memory is still 199.2MB. Free memory was 160.0MB in the beginning and 158.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.62ms. Allocated memory is still 199.2MB. Free memory was 158.0MB in the beginning and 156.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 468.85ms. Allocated memory is still 199.2MB. Free memory was 156.7MB in the beginning and 144.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 178453.20ms. Allocated memory was 199.2MB in the beginning and 245.4MB in the end (delta: 46.1MB). Free memory was 143.3MB in the beginning and 157.5MB in the end (delta: -14.3MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_5.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN --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 b041289a049a7233b2a378ca6fc5bbde9d5c291c849eb6ce585cee09751124ba --- 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-6b4ec56 [2022-11-20 11:41:06,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:41:06,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:41:06,684 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:41:06,684 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:41:06,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:41:06,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:41:06,696 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:41:06,698 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:41:06,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:41:06,705 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:41:06,707 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:41:06,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:41:06,710 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:41:06,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:41:06,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:41:06,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:41:06,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:41:06,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:41:06,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:41:06,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:41:06,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:41:06,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:41:06,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:41:06,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:41:06,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:41:06,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:41:06,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:41:06,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:41:06,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:41:06,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:41:06,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:41:06,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:41:06,752 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:41:06,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:41:06,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:41:06,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:41:06,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:41:06,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:41:06,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:41:06,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:41:06,779 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-20 11:41:06,812 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:41:06,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:41:06,814 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:41:06,814 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:41:06,815 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:41:06,815 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:41:06,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:41:06,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:41:06,816 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:41:06,816 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:41:06,817 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:41:06,818 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:41:06,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:41:06,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:41:06,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:41:06,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:41:06,818 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 11:41:06,819 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 11:41:06,819 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 11:41:06,819 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:41:06,819 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:41:06,819 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:41:06,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:41:06,820 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:41:06,820 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:41:06,820 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:41:06,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:41:06,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:41:06,821 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:41:06,821 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:41:06,821 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 11:41:06,821 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 11:41:06,822 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:41:06,822 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:41:06,822 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:41:06,822 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 11:41:06,822 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/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_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN 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 -> b041289a049a7233b2a378ca6fc5bbde9d5c291c849eb6ce585cee09751124ba [2022-11-20 11:41:07,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:41:07,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:41:07,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:41:07,206 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:41:07,206 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:41:07,208 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/combinations/gcd_3+newton_2_5.i [2022-11-20 11:41:10,273 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:41:10,483 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:41:10,484 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i [2022-11-20 11:41:10,491 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/data/c1887a0df/98914d9a65b041e3a775410704a403ea/FLAG6b3654667 [2022-11-20 11:41:10,506 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/data/c1887a0df/98914d9a65b041e3a775410704a403ea [2022-11-20 11:41:10,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:41:10,510 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:41:10,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:41:10,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:41:10,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:41:10,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:41:10" (1/1) ... [2022-11-20 11:41:10,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e6a9233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:10, skipping insertion in model container [2022-11-20 11:41:10,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:41:10" (1/1) ... [2022-11-20 11:41:10,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:41:10,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:41:10,700 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[1226,1239] [2022-11-20 11:41:10,724 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[2841,2854] [2022-11-20 11:41:10,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:41:10,738 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:41:10,752 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[1226,1239] [2022-11-20 11:41:10,763 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[2841,2854] [2022-11-20 11:41:10,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:41:10,800 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:41:10,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:10 WrapperNode [2022-11-20 11:41:10,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:41:10,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:41:10,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:41:10,803 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:41:10,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:10" (1/1) ... [2022-11-20 11:41:10,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:10" (1/1) ... [2022-11-20 11:41:10,849 INFO L138 Inliner]: procedures = 28, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 80 [2022-11-20 11:41:10,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:41:10,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:41:10,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:41:10,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:41:10,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:10" (1/1) ... [2022-11-20 11:41:10,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:10" (1/1) ... [2022-11-20 11:41:10,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:10" (1/1) ... [2022-11-20 11:41:10,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:10" (1/1) ... [2022-11-20 11:41:10,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:10" (1/1) ... [2022-11-20 11:41:10,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:10" (1/1) ... [2022-11-20 11:41:10,915 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:10" (1/1) ... [2022-11-20 11:41:10,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:10" (1/1) ... [2022-11-20 11:41:10,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:41:10,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:41:10,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:41:10,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:41:10,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:10" (1/1) ... [2022-11-20 11:41:10,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:41:10,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:41:10,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:41:10,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:41:11,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:41:11,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 11:41:11,013 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-20 11:41:11,013 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-20 11:41:11,013 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-20 11:41:11,013 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-20 11:41:11,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:41:11,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:41:11,092 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:41:11,095 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:41:20,255 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:41:20,262 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:41:20,263 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 11:41:20,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:41:20 BoogieIcfgContainer [2022-11-20 11:41:20,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:41:20,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:41:20,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:41:20,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:41:20,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:41:10" (1/3) ... [2022-11-20 11:41:20,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12fdc1a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:41:20, skipping insertion in model container [2022-11-20 11:41:20,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:41:10" (2/3) ... [2022-11-20 11:41:20,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12fdc1a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:41:20, skipping insertion in model container [2022-11-20 11:41:20,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:41:20" (3/3) ... [2022-11-20 11:41:20,275 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_5.i [2022-11-20 11:41:20,294 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:41:20,294 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 11:41:20,344 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:41:20,351 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;@1b2a35c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:41:20,351 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-20 11:41:20,356 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-20 11:41:20,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:41:20,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:41:20,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:41:20,366 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:41:20,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:41:20,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-11-20 11:41:20,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:41:20,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506910595] [2022-11-20 11:41:20,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:41:20,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:41:20,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:41:20,391 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 11:41:20,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-20 11:41:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:41:20,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 11:41:20,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:41:20,634 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-20 11:41:20,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:41:20,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:41:20,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506910595] [2022-11-20 11:41:20,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1506910595] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:41:20,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:41:20,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 11:41:20,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565029830] [2022-11-20 11:41:20,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:41:20,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:41:20,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:41:20,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:41:20,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:41:20,676 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 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-20 11:41:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:41:20,703 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2022-11-20 11:41:20,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:41:20,705 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-20 11:41:20,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:41:20,712 INFO L225 Difference]: With dead ends: 68 [2022-11-20 11:41:20,713 INFO L226 Difference]: Without dead ends: 30 [2022-11-20 11:41:20,716 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-20 11:41:20,719 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:41:20,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-11-20 11:41:20,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-20 11:41:20,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-20 11:41:20,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 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-20 11:41:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-20 11:41:20,760 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2022-11-20 11:41:20,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:41:20,761 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-20 11:41:20,761 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-20 11:41:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-20 11:41:20,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:41:20,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:41:20,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:41:20,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-20 11:41:20,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:41:20,976 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:41:20,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:41:20,977 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2022-11-20 11:41:20,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:41:20,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782824224] [2022-11-20 11:41:20,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:41:20,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:41:20,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:41:20,979 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 11:41:20,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-20 11:41:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:41:21,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 11:41:21,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:41:21,202 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-20 11:41:21,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:41:21,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:41:21,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782824224] [2022-11-20 11:41:21,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782824224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:41:21,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:41:21,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 11:41:21,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978491622] [2022-11-20 11:41:21,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:41:21,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 11:41:21,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:41:21,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 11:41:21,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:41:21,207 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-20 11:41:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:41:21,363 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-11-20 11:41:21,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 11:41:21,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-20 11:41:21,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:41:21,370 INFO L225 Difference]: With dead ends: 46 [2022-11-20 11:41:21,370 INFO L226 Difference]: Without dead ends: 37 [2022-11-20 11:41:21,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 11:41:21,372 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:41:21,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 88 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 11:41:21,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-20 11:41:21,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-11-20 11:41:21,387 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-20 11:41:21,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-20 11:41:21,390 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-11-20 11:41:21,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:41:21,391 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-20 11:41:21,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-20 11:41:21,392 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-20 11:41:21,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 11:41:21,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:41:21,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:41:21,410 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-20 11:41:21,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:41:21,605 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:41:21,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:41:21,606 INFO L85 PathProgramCache]: Analyzing trace with hash -743724587, now seen corresponding path program 1 times [2022-11-20 11:41:21,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:41:21,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230198738] [2022-11-20 11:41:21,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:41:21,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:41:21,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:41:21,609 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 11:41:21,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-20 11:41:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:41:21,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 11:41:21,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:41:22,182 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-20 11:41:22,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:41:22,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:41:22,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230198738] [2022-11-20 11:41:22,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230198738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:41:22,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:41:22,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:41:22,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964972639] [2022-11-20 11:41:22,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:41:22,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:41:22,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:41:22,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:41:22,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:41:22,186 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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-20 11:41:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:41:22,876 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-11-20 11:41:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:41:22,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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-20 11:41:22,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:41:22,881 INFO L225 Difference]: With dead ends: 37 [2022-11-20 11:41:22,881 INFO L226 Difference]: Without dead ends: 31 [2022-11-20 11:41:22,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:41:22,886 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:41:22,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 155 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:41:22,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-20 11:41:22,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-11-20 11:41:22,892 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-20 11:41:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-20 11:41:22,893 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-11-20 11:41:22,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:41:22,893 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-20 11:41:22,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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-20 11:41:22,894 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-20 11:41:22,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 11:41:22,894 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:41:22,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:41:22,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:41:23,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:41:23,110 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:41:23,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:41:23,110 INFO L85 PathProgramCache]: Analyzing trace with hash 830014046, now seen corresponding path program 1 times [2022-11-20 11:41:23,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:41:23,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558789936] [2022-11-20 11:41:23,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:41:23,111 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:41:23,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:41:23,112 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 11:41:23,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-20 11:41:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:41:23,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 11:41:23,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:41:25,994 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-20 11:41:25,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:41:42,578 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-20 11:41:42,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:41:42,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558789936] [2022-11-20 11:41:42,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [558789936] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:41:42,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:41:42,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-11-20 11:41:42,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504922377] [2022-11-20 11:41:42,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:41:42,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 11:41:42,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:41:42,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 11:41:42,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=238, Unknown=5, NotChecked=0, Total=306 [2022-11-20 11:41:42,581 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-20 11:41:42,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:41:42,641 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-11-20 11:41:42,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 11:41:42,642 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-20 11:41:42,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:41:42,657 INFO L225 Difference]: With dead ends: 43 [2022-11-20 11:41:42,658 INFO L226 Difference]: Without dead ends: 33 [2022-11-20 11:41:42,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=63, Invalid=238, Unknown=5, NotChecked=0, Total=306 [2022-11-20 11:41:42,659 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:41:42,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 268 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2022-11-20 11:41:42,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-20 11:41:42,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-11-20 11:41:42,667 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-20 11:41:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-20 11:41:42,668 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 12 [2022-11-20 11:41:42,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:41:42,668 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-20 11:41:42,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-20 11:41:42,669 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-20 11:41:42,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 11:41:42,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:41:42,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:41:42,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:41:42,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:41:42,870 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:41:42,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:41:42,870 INFO L85 PathProgramCache]: Analyzing trace with hash 20667420, now seen corresponding path program 1 times [2022-11-20 11:41:42,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:41:42,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748187966] [2022-11-20 11:41:42,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:41:42,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:41:42,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:41:42,873 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 11:41:42,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-20 11:41:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:41:42,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 11:41:42,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:41:47,755 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-20 11:41:47,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:41:57,151 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-20 11:41:57,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:41:57,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748187966] [2022-11-20 11:41:57,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748187966] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:41:57,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:41:57,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-11-20 11:41:57,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88193838] [2022-11-20 11:41:57,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:41:57,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 11:41:57,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:41:57,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 11:41:57,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-11-20 11:41:57,153 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-20 11:42:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:42:05,190 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-11-20 11:42:05,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 11:42:05,191 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-20 11:42:05,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:42:05,192 INFO L225 Difference]: With dead ends: 45 [2022-11-20 11:42:05,192 INFO L226 Difference]: Without dead ends: 35 [2022-11-20 11:42:05,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2022-11-20 11:42:05,194 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 23 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:42:05,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 199 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 9 Unchecked, 1.3s Time] [2022-11-20 11:42:05,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-20 11:42:05,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-11-20 11:42:05,201 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-20 11:42:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-20 11:42:05,202 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 12 [2022-11-20 11:42:05,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:42:05,202 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-20 11:42:05,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-20 11:42:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-20 11:42:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 11:42:05,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:42:05,204 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:42:05,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-20 11:42:05,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:42:05,415 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:42:05,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:42:05,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1518646018, now seen corresponding path program 2 times [2022-11-20 11:42:05,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:42:05,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245883753] [2022-11-20 11:42:05,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:42:05,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:42:05,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:42:05,419 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 11:42:05,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-20 11:42:10,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:42:10,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:42:10,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-20 11:42:10,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:42:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:42:39,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:44:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:44:11,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:44:11,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245883753] [2022-11-20 11:44:11,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245883753] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:44:11,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:44:11,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-11-20 11:44:11,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729543443] [2022-11-20 11:44:11,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:44:11,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-20 11:44:11,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:44:11,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 11:44:11,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=360, Unknown=25, NotChecked=0, Total=462 [2022-11-20 11:44:11,156 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:44:12,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 11:45:00,420 WARN L233 SmtUtils]: Spent 17.96s on a formula simplification. DAG size of input: 36 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:45:38,425 WARN L233 SmtUtils]: Spent 20.11s on a formula simplification. DAG size of input: 42 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:45:38,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:45:38,440 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-11-20 11:45:38,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 11:45:38,440 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 11:45:38,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:45:38,441 INFO L225 Difference]: With dead ends: 47 [2022-11-20 11:45:38,441 INFO L226 Difference]: Without dead ends: 37 [2022-11-20 11:45:38,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 187.0s TimeCoverageRelationStatistics Valid=150, Invalid=626, Unknown=36, NotChecked=0, Total=812 [2022-11-20 11:45:38,443 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-20 11:45:38,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 287 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 24 Unchecked, 1.9s Time] [2022-11-20 11:45:38,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-20 11:45:38,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2022-11-20 11:45:38,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 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-20 11:45:38,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-11-20 11:45:38,452 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 14 [2022-11-20 11:45:38,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:45:38,453 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-11-20 11:45:38,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:45:38,453 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-11-20 11:45:38,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 11:45:38,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:45:38,454 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:45:38,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-20 11:45:38,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:45:38,668 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:45:38,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:45:38,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1825995883, now seen corresponding path program 2 times [2022-11-20 11:45:38,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 11:45:38,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275449377] [2022-11-20 11:45:38,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 11:45:38,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 11:45:38,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 11:45:38,671 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 11:45:38,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23321d2c-d2a3-4cd0-bb50-f6baf6bdb9b9/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-20 11:45:48,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 11:45:48,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 11:45:48,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 11:45:48,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:47:29,195 WARN L233 SmtUtils]: Spent 10.40s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:47:45,804 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| (_ BitVec 8)) (|ULTIMATE.start_main1_~x~0#1| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |ULTIMATE.start_main1_~x~0#1|)) (.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_gcd_test_~a#1_24|))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse3))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse4))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse2))))) (and (not (bvsge .cse0 .cse1)) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse2 .cse1)))) (not (bvslt .cse3 (_ bv0 32))) (not (bvslt .cse0 (_ bv0 32))))))))) is different from false [2022-11-20 11:47:47,829 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| (_ BitVec 8)) (|ULTIMATE.start_main1_~x~0#1| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |ULTIMATE.start_main1_~x~0#1|)) (.cse3 ((_ sign_extend 24) |v_ULTIMATE.start_gcd_test_~a#1_24|))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse3))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse4))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse2))))) (and (not (bvsge .cse0 .cse1)) (= (_ bv0 32) ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse2 .cse1)))) (not (bvslt .cse3 (_ bv0 32))) (not (bvslt .cse0 (_ bv0 32))))))))) is different from true [2022-11-20 11:47:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:47:47,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:51:20,185 WARN L233 SmtUtils]: Spent 6.76s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:51:43,977 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_gcd_test_~b#1| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_8| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_8|)) (.cse3 ((_ sign_extend 24) |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse3))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse4))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse2))))) (or (bvsge .cse0 .cse1) (bvslt .cse0 (_ bv0 32)) (not (= ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse2 .cse1))) (_ bv0 32))) (bvslt .cse3 (_ bv0 32)))))))) is different from false [2022-11-20 11:51:46,006 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_gcd_test_~b#1| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~x~0#1_8| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~x~0#1_8|)) (.cse3 ((_ sign_extend 24) |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse4 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse3))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse4))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse4 .cse2))))) (or (bvsge .cse0 .cse1) (bvslt .cse0 (_ bv0 32)) (not (= ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse2 .cse1))) (_ bv0 32))) (bvslt .cse3 (_ bv0 32)))))))) is different from true [2022-11-20 11:52:00,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:52:00,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 11:52:00,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275449377] [2022-11-20 11:52:00,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275449377] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:52:00,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 11:52:00,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2022-11-20 11:52:00,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919790731] [2022-11-20 11:52:00,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 11:52:00,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 11:52:00,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 11:52:00,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 11:52:00,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=420, Unknown=68, NotChecked=90, Total=650 [2022-11-20 11:52:00,749 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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-20 11:52:29,041 WARN L233 SmtUtils]: Spent 20.78s on a formula simplification. DAG size of input: 32 DAG size of output: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 11:52:51,724 WARN L233 SmtUtils]: Spent 14.30s on a formula simplification. DAG size of input: 33 DAG size of output: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)