./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_3_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_3_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8 --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 cf7f7457cdd0c5557ed6396b1b77324a2673e1bc1f66f80f06950a47fe88485c --- 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-e04fb08 [2022-11-16 12:06:53,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:06:53,902 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:06:53,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:06:53,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:06:53,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:06:53,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:06:53,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:06:53,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:06:53,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:06:53,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:06:53,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:06:53,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:06:53,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:06:53,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:06:53,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:06:53,986 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:06:53,992 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:06:53,994 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:06:53,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:06:54,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:06:54,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:06:54,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:06:54,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:06:54,010 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:06:54,019 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:06:54,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:06:54,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:06:54,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:06:54,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:06:54,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:06:54,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:06:54,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:06:54,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:06:54,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:06:54,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:06:54,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:06:54,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:06:54,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:06:54,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:06:54,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:06:54,037 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:06:54,096 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:06:54,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:06:54,097 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:06:54,097 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:06:54,097 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:06:54,098 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:06:54,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:06:54,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:06:54,099 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:06:54,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:06:54,099 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:06:54,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:06:54,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:06:54,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:06:54,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:06:54,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:06:54,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:06:54,101 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:06:54,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:06:54,101 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:06:54,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:06:54,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:06:54,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:06:54,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:06:54,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:06:54,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:06:54,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:06:54,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:06:54,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:06:54,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:06:54,104 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:06:54,104 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:06:54,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:06:54,104 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_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8 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 -> cf7f7457cdd0c5557ed6396b1b77324a2673e1bc1f66f80f06950a47fe88485c [2022-11-16 12:06:54,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:06:54,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:06:54,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:06:54,539 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:06:54,540 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:06:54,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/combinations/gcd_2+newton_3_3.i [2022-11-16 12:06:54,626 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/data/a49c320dd/07cdccb185ef48a786f18e1160bcab21/FLAG397bd6b4c [2022-11-16 12:06:55,303 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:06:55,303 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i [2022-11-16 12:06:55,316 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/data/a49c320dd/07cdccb185ef48a786f18e1160bcab21/FLAG397bd6b4c [2022-11-16 12:06:55,633 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/data/a49c320dd/07cdccb185ef48a786f18e1160bcab21 [2022-11-16 12:06:55,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:06:55,638 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:06:55,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:06:55,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:06:55,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:06:55,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:55" (1/1) ... [2022-11-16 12:06:55,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49926bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:55, skipping insertion in model container [2022-11-16 12:06:55,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:55" (1/1) ... [2022-11-16 12:06:55,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:06:55,679 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:06:55,928 WARN L229 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_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i[1226,1239] [2022-11-16 12:06:55,958 WARN L229 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_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i[2862,2875] [2022-11-16 12:06:55,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:06:55,971 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:06:55,989 WARN L229 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_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i[1226,1239] [2022-11-16 12:06:56,002 WARN L229 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_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i[2862,2875] [2022-11-16 12:06:56,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:06:56,020 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:06:56,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:56 WrapperNode [2022-11-16 12:06:56,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:06:56,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:06:56,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:06:56,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:06:56,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:56" (1/1) ... [2022-11-16 12:06:56,042 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:56" (1/1) ... [2022-11-16 12:06:56,084 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 90 [2022-11-16 12:06:56,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:06:56,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:06:56,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:06:56,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:06:56,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:56" (1/1) ... [2022-11-16 12:06:56,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:56" (1/1) ... [2022-11-16 12:06:56,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:56" (1/1) ... [2022-11-16 12:06:56,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:56" (1/1) ... [2022-11-16 12:06:56,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:56" (1/1) ... [2022-11-16 12:06:56,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:56" (1/1) ... [2022-11-16 12:06:56,137 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:56" (1/1) ... [2022-11-16 12:06:56,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:56" (1/1) ... [2022-11-16 12:06:56,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:06:56,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:06:56,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:06:56,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:06:56,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:56" (1/1) ... [2022-11-16 12:06:56,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:06:56,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:06:56,202 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:06:56,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:06:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:06:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-16 12:06:56,260 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-16 12:06:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-16 12:06:56,262 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-16 12:06:56,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:06:56,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:06:56,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:06:56,373 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:06:56,376 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:06:56,693 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:06:56,701 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:06:56,701 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 12:06:56,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:56 BoogieIcfgContainer [2022-11-16 12:06:56,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:06:56,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:06:56,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:06:56,727 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:06:56,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:06:55" (1/3) ... [2022-11-16 12:06:56,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d706ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:06:56, skipping insertion in model container [2022-11-16 12:06:56,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:56" (2/3) ... [2022-11-16 12:06:56,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d706ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:06:56, skipping insertion in model container [2022-11-16 12:06:56,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:56" (3/3) ... [2022-11-16 12:06:56,731 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_3.i [2022-11-16 12:06:56,770 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:06:56,770 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 12:06:56,854 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:06:56,867 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;@5e0f8b9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:06:56,868 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-16 12:06:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:06:56,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 12:06:56,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:06:56,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:06:56,891 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:06:56,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:06:56,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-11-16 12:06:56,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:06:56,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576590330] [2022-11-16 12:06:56,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:06:56,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:06:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:06:57,375 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-16 12:06:57,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:06:57,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576590330] [2022-11-16 12:06:57,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576590330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:06:57,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:06:57,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:06:57,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141974287] [2022-11-16 12:06:57,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:06:57,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:06:57,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:06:57,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:06:57,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:06:57,438 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 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-16 12:06:57,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:06:57,629 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-11-16 12:06:57,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:06:57,633 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-16 12:06:57,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:06:57,653 INFO L225 Difference]: With dead ends: 96 [2022-11-16 12:06:57,660 INFO L226 Difference]: Without dead ends: 39 [2022-11-16 12:06:57,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:06:57,674 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 30 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:06:57,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 122 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:06:57,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-16 12:06:57,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2022-11-16 12:06:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:06:57,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-11-16 12:06:57,740 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2022-11-16 12:06:57,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:06:57,740 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-11-16 12:06:57,741 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-16 12:06:57,741 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-11-16 12:06:57,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 12:06:57,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:06:57,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:06:57,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:06:57,744 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:06:57,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:06:57,745 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2022-11-16 12:06:57,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:06:57,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455880807] [2022-11-16 12:06:57,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:06:57,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:06:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:06:57,888 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-16 12:06:57,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:06:57,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455880807] [2022-11-16 12:06:57,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455880807] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:06:57,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:06:57,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:06:57,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456501523] [2022-11-16 12:06:57,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:06:57,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:06:57,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:06:57,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:06:57,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:06:57,893 INFO L87 Difference]: Start difference. First operand 32 states and 37 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-16 12:06:57,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:06:57,925 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-11-16 12:06:57,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:06:57,926 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-16 12:06:57,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:06:57,927 INFO L225 Difference]: With dead ends: 39 [2022-11-16 12:06:57,927 INFO L226 Difference]: Without dead ends: 33 [2022-11-16 12:06:57,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:06:57,929 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:06:57,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 97 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:06:57,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-16 12:06:57,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-16 12:06:57,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:06:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-11-16 12:06:57,939 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2022-11-16 12:06:57,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:06:57,940 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-11-16 12:06:57,940 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-16 12:06:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-11-16 12:06:57,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 12:06:57,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:06:57,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:06:57,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:06:57,942 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:06:57,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:06:57,943 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2022-11-16 12:06:57,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:06:57,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218884087] [2022-11-16 12:06:57,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:06:57,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:06:57,966 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:06:57,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [56992033] [2022-11-16 12:06:57,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:06:57,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:06:57,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:06:57,972 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:06:57,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:06:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:06:58,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 12:06:58,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:06:58,195 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-16 12:06:58,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:06:58,251 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-16 12:06:58,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:06:58,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218884087] [2022-11-16 12:06:58,253 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:06:58,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56992033] [2022-11-16 12:06:58,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56992033] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:06:58,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:06:58,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-11-16 12:06:58,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138293849] [2022-11-16 12:06:58,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:06:58,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:06:58,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:06:58,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:06:58,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:06:58,256 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:06:58,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:06:58,356 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-11-16 12:06:58,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:06:58,357 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 12:06:58,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:06:58,358 INFO L225 Difference]: With dead ends: 40 [2022-11-16 12:06:58,358 INFO L226 Difference]: Without dead ends: 34 [2022-11-16 12:06:58,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:06:58,360 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:06:58,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 214 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:06:58,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-16 12:06:58,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-16 12:06:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:06:58,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-11-16 12:06:58,367 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2022-11-16 12:06:58,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:06:58,368 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-11-16 12:06:58,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:06:58,368 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-11-16 12:06:58,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:06:58,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:06:58,369 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:06:58,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:06:58,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:06:58,577 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:06:58,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:06:58,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1659957129, now seen corresponding path program 2 times [2022-11-16 12:06:58,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:06:58,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118025008] [2022-11-16 12:06:58,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:06:58,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:06:58,593 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:06:58,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1977157413] [2022-11-16 12:06:58,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:06:58,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:06:58,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:06:58,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:06:58,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:06:58,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:06:58,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:06:58,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 12:06:58,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:07:12,113 WARN L233 SmtUtils]: Spent 12.20s on a formula simplification. DAG size of input: 72 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:07:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:07:14,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:09:38,234 WARN L233 SmtUtils]: Spent 2.19m on a formula simplification. DAG size of input: 129 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:09:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:09:39,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:09:39,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118025008] [2022-11-16 12:09:39,100 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:09:39,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977157413] [2022-11-16 12:09:39,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977157413] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:09:39,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:09:39,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-11-16 12:09:39,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849032270] [2022-11-16 12:09:39,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:09:39,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 12:09:39,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:09:39,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 12:09:39,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:09:39,121 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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-16 12:09:44,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:09:44,616 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-11-16 12:09:44,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:09:44,617 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-16 12:09:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:09:44,618 INFO L225 Difference]: With dead ends: 41 [2022-11-16 12:09:44,618 INFO L226 Difference]: Without dead ends: 35 [2022-11-16 12:09:44,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 152.7s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:09:44,620 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:09:44,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 302 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 22 Unchecked, 0.0s Time] [2022-11-16 12:09:44,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-16 12:09:44,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-16 12:09:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:09:44,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-11-16 12:09:44,630 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 13 [2022-11-16 12:09:44,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:09:44,631 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-11-16 12:09:44,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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-16 12:09:44,631 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-11-16 12:09:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 12:09:44,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:09:44,632 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:09:44,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-16 12:09:44,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:09:44,838 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:09:44,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:09:44,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1682229690, now seen corresponding path program 3 times [2022-11-16 12:09:44,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:09:44,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420676601] [2022-11-16 12:09:44,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:09:44,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:09:44,849 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:09:44,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1247526461] [2022-11-16 12:09:44,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:09:44,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:09:44,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:09:44,860 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:09:44,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:09:45,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 12:09:45,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:09:45,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-16 12:09:45,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:09:59,703 WARN L233 SmtUtils]: Spent 6.80s on a formula simplification. DAG size of input: 55 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:10:42,385 WARN L233 SmtUtils]: Spent 28.76s on a formula simplification. DAG size of input: 88 DAG size of output: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:11:15,273 WARN L233 SmtUtils]: Spent 24.67s on a formula simplification. DAG size of input: 65 DAG size of output: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:11:28,987 WARN L233 SmtUtils]: Spent 9.49s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:11:56,617 WARN L233 SmtUtils]: Spent 19.45s on a formula simplification. DAG size of input: 61 DAG size of output: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:11:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:11:58,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:13:24,256 WARN L233 SmtUtils]: Spent 1.13m on a formula simplification. DAG size of input: 88 DAG size of output: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:14:49,542 WARN L855 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (let ((.cse7 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (let ((.cse26 (not .cse7)) (.cse2 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse1 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod .cse1 256))) (let ((.cse3 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse0) 256))) (or (= .cse0 0) (<= (mod (+ .cse1 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse3) 256) 0)) (not (<= .cse0 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse0) (<= .cse3 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse6 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse5 (mod (+ .cse6 .cse2) 256))) (let ((.cse4 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse5)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse5 127) (not (<= (mod .cse6 256) 127)) (<= (mod (+ .cse6 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse4) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse5) (= .cse6 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse7) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse10 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod .cse10 256))) (let ((.cse8 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse9)) 256))) (or (<= .cse8 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse9) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse8) 256) 0)) (<= (mod (+ .cse10 .cse2) 256) 127) (<= .cse9 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod (+ .cse13 .cse2) 256))) (let ((.cse11 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse12)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse11 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse12 127) (<= (mod .cse13 256) 127) (<= (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse11) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse12)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse14 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse14 .cse2) 256))) (let ((.cse15 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse16)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse15 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse16 127) (not (<= (mod .cse14 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse15) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse16) (= .cse14 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod .cse18 256))) (let ((.cse19 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse17) 256))) (or (= .cse17 0) (not (<= (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse18 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse19) 256) 0)) (not (<= .cse17 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse17) (<= .cse19 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse7) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse20 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse21 (mod .cse20 256))) (let ((.cse22 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse21) 256))) (or (not (<= (mod (+ .cse20 .cse2) 256) 127)) (= .cse21 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse22) 256) 0)) (not (<= .cse21 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse21) (<= .cse22 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse23 (mod (+ .cse25 .cse2) 256))) (let ((.cse24 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse23) 256))) (or (not (<= .cse23 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse24) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse23) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse23 0) (<= .cse24 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse25 256) 127)) (<= (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse25 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse7) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod .cse29 256))) (let ((.cse27 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse28)) 256))) (or (<= .cse27 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse28) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse27) 256) 0)) (not (<= (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse29 .cse2) 256) 127) (<= .cse28 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse30) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse30 127)) (<= (mod (+ .cse31 .cse2) 256) 127) (<= (mod .cse31 256) 127) (= 0 .cse30) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse30) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse32) 256) 0)) (<= .cse32 |c_ULTIMATE.start_main1_~y~0#1|)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse35 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod (+ .cse35 .cse2) 256))) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse33) 256))) (or (not (<= .cse33 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse34) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse33) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse33 0) (<= .cse34 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse35 256) 127) (<= (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse37 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod .cse37 256))) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse38)) 256))) (or (<= .cse36 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse37 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse38) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse36) 256) 0)) (<= .cse38 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse37 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse7) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse39 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse40 (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse41 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse40) 256))) (or (not (<= (mod (+ .cse39 .cse2) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse40 127)) (= 0 .cse40) (not (<= (mod .cse39 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse40) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse41) 256) 0)) (<= .cse41 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse43 (mod .cse42 256))) (let ((.cse44 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse43) 256))) (or (not (<= (mod (+ .cse42 .cse2) 256) 127)) (= .cse43 0) (not (<= (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse44) 256) 0)) (not (<= .cse43 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse43) (<= .cse44 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod .cse45 256))) (let ((.cse47 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse46) 256))) (or (not (<= (mod (+ .cse45 .cse2) 256) 127)) (= .cse46 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse47) 256) 0)) (not (<= .cse46 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse46) (<= .cse47 |c_ULTIMATE.start_main1_~y~0#1|)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse48 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse49 (mod (+ .cse48 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse50 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse49)) 256))) (or (not (<= (mod (+ .cse48 .cse2) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod .cse48 256) 127)) (<= .cse49 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse49) (<= .cse50 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse50) 256) 0)) (= .cse48 0)))))))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse52 (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse53 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse52)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse51 .cse2) 256) 127) (not (<= (mod .cse51 256) 127)) (<= .cse52 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse52) (<= .cse53 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse53) 256) 0)) (= .cse51 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse55 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse54 (mod .cse55 256))) (let ((.cse56 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse54) 256))) (or (= .cse54 0) (<= (mod (+ .cse55 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse56) 256) 0)) (not (<= .cse54 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse54) (<= .cse56 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse58 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse59 (mod .cse58 256))) (let ((.cse57 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse59)) 256))) (or (<= .cse57 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse58 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse59) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse57) 256) 0)) (not (<= (mod (+ .cse58 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse59 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse62 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse60 (mod (+ .cse62 .cse2) 256))) (let ((.cse61 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse60) 256))) (or (not (<= .cse60 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse61) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse60) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse60 0) (<= .cse61 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse62 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse64 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse63 (mod (+ .cse64 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse65 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse63) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse63 127)) (<= (mod (+ .cse64 .cse2) 256) 127) (= 0 .cse63) (not (<= (mod .cse64 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse63) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse65) 256) 0)) (<= .cse65 |c_ULTIMATE.start_main1_~y~0#1|) (= .cse64 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse67 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse66 (mod .cse67 256))) (let ((.cse68 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse66) 256))) (or (= .cse66 0) (not (<= (mod (+ .cse67 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse67 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse68) 256) 0)) (not (<= .cse66 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse66) (<= .cse68 |c_ULTIMATE.start_main1_~y~0#1|)))))))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse69 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse71 (mod (+ .cse69 .cse2) 256))) (let ((.cse70 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse71)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse69 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse70 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse71 127) (<= (mod .cse69 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse70) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse71)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse74 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse73 (mod .cse74 256))) (let ((.cse72 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse73)) 256))) (or (<= .cse72 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse73) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse72) 256) 0)) (not (<= (mod (+ .cse74 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse74 .cse2) 256) 127) (<= .cse73 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse75 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse76 (mod (+ .cse75 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse77 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse76)) 256))) (or (not (<= (mod (+ .cse75 .cse2) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse75 256) 127) (<= .cse76 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse76) (<= .cse77 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse77) 256) 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse79 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse80 (mod .cse79 256))) (let ((.cse78 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse80)) 256))) (or (<= .cse78 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse79 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse80) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse78) 256) 0)) (<= .cse80 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse79 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse83 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse82 (mod .cse83 256))) (let ((.cse81 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse82)) 256))) (or (<= .cse81 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse82) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse81) 256) 0)) (<= (mod (+ .cse83 .cse2) 256) 127) (<= .cse82 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse83 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse84 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse85 (mod (+ .cse84 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse86 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse85)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse84 .cse2) 256) 127) (<= (mod .cse84 256) 127) (<= .cse85 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse85) (<= .cse86 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse86) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse89 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse87 (mod (+ .cse89 .cse2) 256))) (let ((.cse88 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse87) 256))) (or (not (<= .cse87 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse88) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse87) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse89 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse87 0) (<= .cse88 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse89 256) 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse90 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse91 (mod .cse90 256))) (let ((.cse92 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse91) 256))) (or (not (<= (mod (+ .cse90 .cse2) 256) 127)) (= .cse91 0) (not (<= (mod (+ .cse90 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse92) 256) 0)) (not (<= .cse91 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse91) (<= .cse92 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse94 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse95 (mod .cse94 256))) (let ((.cse93 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse95)) 256))) (or (<= .cse93 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse94 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse95) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse93) 256) 0)) (not (<= (mod (+ .cse94 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse95 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse96 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse97 (mod (+ .cse96 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse98 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse97) 256))) (or (not (<= (mod (+ .cse96 .cse2) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse97 127)) (<= (mod .cse96 256) 127) (= 0 .cse97) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse97) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse98) 256) 0)) (<= .cse98 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0)))))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) is different from true [2022-11-16 12:15:11,977 WARN L855 $PredicateComparison]: unable to prove that (or (let ((.cse2 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse1 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod .cse1 256))) (let ((.cse3 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse0) 256))) (or (= .cse0 0) (<= (mod (+ .cse1 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse3) 256) 0)) (not (<= .cse0 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse0) (<= .cse3 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse5 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod .cse5 256))) (let ((.cse4 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse6)) 256))) (or (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse5 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse6) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse4) 256) 0)) (not (<= (mod (+ .cse5 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse6 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse9 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod (+ .cse9 .cse2) 256))) (let ((.cse8 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse7) 256))) (or (not (<= .cse7 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse8) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse7) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse7 0) (<= .cse8 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse9 256) 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse10 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod (+ .cse10 .cse2) 256))) (let ((.cse11 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse12)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse11 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse12 127) (not (<= (mod .cse10 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse11) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse12) (= .cse10 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod .cse13 256))) (let ((.cse15 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse14) 256))) (or (not (<= (mod (+ .cse13 .cse2) 256) 127)) (= .cse14 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse15) 256) 0)) (not (<= .cse14 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse14) (<= .cse15 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse18 .cse2) 256))) (let ((.cse17 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse16) 256))) (or (not (<= .cse16 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse17) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse16) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse16 0) (<= .cse17 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse18 256) 127)) (<= (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse18 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse21 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod .cse21 256))) (let ((.cse19 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse20)) 256))) (or (<= .cse19 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse20) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse19) 256) 0)) (<= (mod (+ .cse21 .cse2) 256) 127) (<= .cse20 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse22 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod (+ .cse22 .cse2) 256))) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse24)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse22 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse23 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse24 127) (<= (mod .cse22 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse23) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse24)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse27 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod (+ .cse27 .cse2) 256))) (let ((.cse26 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse25) 256))) (or (not (<= .cse25 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse26) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse25) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse25 0) (<= .cse26 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse27 256) 127) (<= (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse28 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod .cse28 256))) (let ((.cse30 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse29) 256))) (or (not (<= (mod (+ .cse28 .cse2) 256) 127)) (= .cse29 0) (not (<= (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse30) 256) 0)) (not (<= .cse29 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse29) (<= .cse30 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse33 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod (+ .cse33 .cse2) 256))) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse31) 256))) (or (not (<= .cse31 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse32) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse31) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse31 0) (<= .cse32 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse33 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse36 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse35 (mod (+ .cse36 .cse2) 256))) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse35)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse34 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse35 127) (not (<= (mod .cse36 256) 127)) (<= (mod (+ .cse36 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse34) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse35) (= .cse36 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse39 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod (+ .cse39 .cse2) 256))) (let ((.cse37 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse38)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse37 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse38 127) (<= (mod .cse39 256) 127) (<= (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse37) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse38)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse41 (mod .cse42 256))) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse41)) 256))) (or (<= .cse40 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse41) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse40) 256) 0)) (not (<= (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse42 .cse2) 256) 127) (<= .cse41 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse44 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse45 (mod .cse44 256))) (let ((.cse43 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse45)) 256))) (or (<= .cse43 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse44 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse45) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse43) 256) 0)) (<= .cse45 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod .cse47 256))) (let ((.cse48 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse46) 256))) (or (= .cse46 0) (not (<= (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse47 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse48) 256) 0)) (not (<= .cse46 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse46) (<= .cse48 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) is different from true [2022-11-16 12:15:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-16 12:15:32,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:15:32,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420676601] [2022-11-16 12:15:32,613 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:15:32,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247526461] [2022-11-16 12:15:32,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247526461] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:15:32,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:15:32,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-11-16 12:15:32,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054080555] [2022-11-16 12:15:32,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:15:32,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 12:15:32,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:15:32,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 12:15:32,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=243, Unknown=11, NotChecked=66, Total=380 [2022-11-16 12:15:32,615 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 20 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-16 12:15:34,653 WARN L855 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (let ((.cse2 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse1 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod .cse1 256))) (let ((.cse3 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse0) 256))) (or (= .cse0 0) (<= (mod (+ .cse1 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse3) 256) 0)) (not (<= .cse0 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse0) (<= .cse3 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse5 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod .cse5 256))) (let ((.cse4 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse6)) 256))) (or (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse5 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse6) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse4) 256) 0)) (not (<= (mod (+ .cse5 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse6 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse9 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod (+ .cse9 .cse2) 256))) (let ((.cse8 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse7) 256))) (or (not (<= .cse7 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse8) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse7) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse7 0) (<= .cse8 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse9 256) 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse10 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod (+ .cse10 .cse2) 256))) (let ((.cse11 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse12)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse11 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse12 127) (not (<= (mod .cse10 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse11) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse12) (= .cse10 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod .cse13 256))) (let ((.cse15 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse14) 256))) (or (not (<= (mod (+ .cse13 .cse2) 256) 127)) (= .cse14 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse15) 256) 0)) (not (<= .cse14 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse14) (<= .cse15 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse18 .cse2) 256))) (let ((.cse17 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse16) 256))) (or (not (<= .cse16 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse17) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse16) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse16 0) (<= .cse17 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse18 256) 127)) (<= (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse18 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse21 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod .cse21 256))) (let ((.cse19 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse20)) 256))) (or (<= .cse19 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse20) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse19) 256) 0)) (<= (mod (+ .cse21 .cse2) 256) 127) (<= .cse20 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse22 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod (+ .cse22 .cse2) 256))) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse24)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse22 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse23 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse24 127) (<= (mod .cse22 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse23) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse24)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse27 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod (+ .cse27 .cse2) 256))) (let ((.cse26 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse25) 256))) (or (not (<= .cse25 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse26) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse25) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse25 0) (<= .cse26 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse27 256) 127) (<= (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse28 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod .cse28 256))) (let ((.cse30 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse29) 256))) (or (not (<= (mod (+ .cse28 .cse2) 256) 127)) (= .cse29 0) (not (<= (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse30) 256) 0)) (not (<= .cse29 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse29) (<= .cse30 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse33 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod (+ .cse33 .cse2) 256))) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse31) 256))) (or (not (<= .cse31 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse32) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse31) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse31 0) (<= .cse32 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse33 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse36 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse35 (mod (+ .cse36 .cse2) 256))) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse35)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse34 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse35 127) (not (<= (mod .cse36 256) 127)) (<= (mod (+ .cse36 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse34) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse35) (= .cse36 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse39 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod (+ .cse39 .cse2) 256))) (let ((.cse37 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse38)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse37 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse38 127) (<= (mod .cse39 256) 127) (<= (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse37) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse38)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse41 (mod .cse42 256))) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse41)) 256))) (or (<= .cse40 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse41) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse40) 256) 0)) (not (<= (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse42 .cse2) 256) 127) (<= .cse41 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse44 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse45 (mod .cse44 256))) (let ((.cse43 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse45)) 256))) (or (<= .cse43 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse44 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse45) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse43) 256) 0)) (<= .cse45 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod .cse47 256))) (let ((.cse48 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse46) 256))) (or (= .cse46 0) (not (<= (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse47 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse48) 256) 0)) (not (<= .cse46 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse46) (<= .cse48 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|)) is different from true [2022-11-16 12:15:36,717 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse8 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (let ((.cse0 (not .cse8))) (and .cse0 (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|) (or (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (let ((.cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse2 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod .cse2 256))) (let ((.cse4 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse1) 256))) (or (= .cse1 0) (<= (mod (+ .cse2 .cse3) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse4) 256) 0)) (not (<= .cse1 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse2 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse1) (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse7 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod (+ .cse7 .cse3) 256))) (let ((.cse5 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse6)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse5 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse6 127) (not (<= (mod .cse7 256) 127)) (<= (mod (+ .cse7 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse5) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse6) (= .cse7 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse8) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse11 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse10 (mod .cse11 256))) (let ((.cse9 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse10)) 256))) (or (<= .cse9 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse10) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse9) 256) 0)) (<= (mod (+ .cse11 .cse3) 256) 127) (<= .cse10 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse14 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse13 (mod (+ .cse14 .cse3) 256))) (let ((.cse12 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse13)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse12 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse13 127) (<= (mod .cse14 256) 127) (<= (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse12) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse13)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse15 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod (+ .cse15 .cse3) 256))) (let ((.cse16 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse17)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse16 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse17 127) (not (<= (mod .cse15 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse16) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse17) (= .cse15 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse19 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (mod .cse19 256))) (let ((.cse20 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse18) 256))) (or (= .cse18 0) (not (<= (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse19 .cse3) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse20) 256) 0)) (not (<= .cse18 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse18) (<= .cse20 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse8) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse21 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod .cse21 256))) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse22) 256))) (or (not (<= (mod (+ .cse21 .cse3) 256) 127)) (= .cse22 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse23) 256) 0)) (not (<= .cse22 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse22) (<= .cse23 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse26 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod (+ .cse26 .cse3) 256))) (let ((.cse25 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse24) 256))) (or (not (<= .cse24 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse25) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse24) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse24 0) (<= .cse25 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse26 256) 127)) (<= (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse26 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse8) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod .cse29 256))) (let ((.cse27 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse28)) 256))) (or (<= .cse27 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse28) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse27) 256) 0)) (not (<= (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse29 .cse3) 256) 127) (<= .cse28 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse30) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse30 127)) (<= (mod (+ .cse31 .cse3) 256) 127) (<= (mod .cse31 256) 127) (= 0 .cse30) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse30) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse32) 256) 0)) (<= .cse32 |c_ULTIMATE.start_main1_~y~0#1|)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse35 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod (+ .cse35 .cse3) 256))) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse33) 256))) (or (not (<= .cse33 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse34) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse33) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse33 0) (<= .cse34 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse35 256) 127) (<= (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse37 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod .cse37 256))) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse38)) 256))) (or (<= .cse36 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse37 .cse3) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse38) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse36) 256) 0)) (<= .cse38 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse37 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse8) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse39 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse40 (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse41 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse40) 256))) (or (not (<= (mod (+ .cse39 .cse3) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse40 127)) (= 0 .cse40) (not (<= (mod .cse39 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse40) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse41) 256) 0)) (<= .cse41 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse43 (mod .cse42 256))) (let ((.cse44 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse43) 256))) (or (not (<= (mod (+ .cse42 .cse3) 256) 127)) (= .cse43 0) (not (<= (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse44) 256) 0)) (not (<= .cse43 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse43) (<= .cse44 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod .cse45 256))) (let ((.cse47 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse46) 256))) (or (not (<= (mod (+ .cse45 .cse3) 256) 127)) (= .cse46 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse47) 256) 0)) (not (<= .cse46 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse46) (<= .cse47 |c_ULTIMATE.start_main1_~y~0#1|)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse48 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse49 (mod (+ .cse48 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse50 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse49)) 256))) (or (not (<= (mod (+ .cse48 .cse3) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod .cse48 256) 127)) (<= .cse49 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse49) (<= .cse50 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse50) 256) 0)) (= .cse48 0)))))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse52 (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse53 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse52)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse51 .cse3) 256) 127) (not (<= (mod .cse51 256) 127)) (<= .cse52 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse52) (<= .cse53 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse53) 256) 0)) (= .cse51 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse55 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse54 (mod .cse55 256))) (let ((.cse56 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse54) 256))) (or (= .cse54 0) (<= (mod (+ .cse55 .cse3) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse56) 256) 0)) (not (<= .cse54 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse54) (<= .cse56 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse58 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse59 (mod .cse58 256))) (let ((.cse57 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse59)) 256))) (or (<= .cse57 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse58 .cse3) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse59) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse57) 256) 0)) (not (<= (mod (+ .cse58 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse59 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse62 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse60 (mod (+ .cse62 .cse3) 256))) (let ((.cse61 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse60) 256))) (or (not (<= .cse60 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse61) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse60) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse60 0) (<= .cse61 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse62 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse64 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse63 (mod (+ .cse64 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse65 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse63) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse63 127)) (<= (mod (+ .cse64 .cse3) 256) 127) (= 0 .cse63) (not (<= (mod .cse64 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse63) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse65) 256) 0)) (<= .cse65 |c_ULTIMATE.start_main1_~y~0#1|) (= .cse64 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse67 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse66 (mod .cse67 256))) (let ((.cse68 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse66) 256))) (or (= .cse66 0) (not (<= (mod (+ .cse67 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse67 .cse3) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse68) 256) 0)) (not (<= .cse66 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse66) (<= .cse68 |c_ULTIMATE.start_main1_~y~0#1|)))))))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse69 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse71 (mod (+ .cse69 .cse3) 256))) (let ((.cse70 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse71)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse69 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse70 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse71 127) (<= (mod .cse69 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse70) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse71)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse74 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse73 (mod .cse74 256))) (let ((.cse72 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse73)) 256))) (or (<= .cse72 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse73) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse72) 256) 0)) (not (<= (mod (+ .cse74 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse74 .cse3) 256) 127) (<= .cse73 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse75 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse76 (mod (+ .cse75 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse77 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse76)) 256))) (or (not (<= (mod (+ .cse75 .cse3) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse75 256) 127) (<= .cse76 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse76) (<= .cse77 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse77) 256) 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse79 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse80 (mod .cse79 256))) (let ((.cse78 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse80)) 256))) (or (<= .cse78 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse79 .cse3) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse80) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse78) 256) 0)) (<= .cse80 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse79 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse83 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse82 (mod .cse83 256))) (let ((.cse81 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse82)) 256))) (or (<= .cse81 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse82) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse81) 256) 0)) (<= (mod (+ .cse83 .cse3) 256) 127) (<= .cse82 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse83 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse84 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse85 (mod (+ .cse84 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse86 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse85)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse84 .cse3) 256) 127) (<= (mod .cse84 256) 127) (<= .cse85 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse85) (<= .cse86 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse86) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse89 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse87 (mod (+ .cse89 .cse3) 256))) (let ((.cse88 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse87) 256))) (or (not (<= .cse87 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse88) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse87) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse89 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse87 0) (<= .cse88 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse89 256) 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse90 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse91 (mod .cse90 256))) (let ((.cse92 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse91) 256))) (or (not (<= (mod (+ .cse90 .cse3) 256) 127)) (= .cse91 0) (not (<= (mod (+ .cse90 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse92) 256) 0)) (not (<= .cse91 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse91) (<= .cse92 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse94 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse95 (mod .cse94 256))) (let ((.cse93 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse95)) 256))) (or (<= .cse93 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse94 .cse3) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse95) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse93) 256) 0)) (not (<= (mod (+ .cse94 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse95 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse96 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse97 (mod (+ .cse96 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse98 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse97) 256))) (or (not (<= (mod (+ .cse96 .cse3) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse97 127)) (<= (mod .cse96 256) 127) (= 0 .cse97) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse97) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse98) 256) 0)) (<= .cse98 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)))))) is different from true [2022-11-16 12:15:45,980 WARN L233 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 54 DAG size of output: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:15:46,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:15:46,316 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-11-16 12:15:46,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:15:46,317 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 20 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-16 12:15:46,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:15:46,318 INFO L225 Difference]: With dead ends: 52 [2022-11-16 12:15:46,318 INFO L226 Difference]: Without dead ends: 42 [2022-11-16 12:15:46,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 203.4s TimeCoverageRelationStatistics Valid=79, Invalid=303, Unknown=14, NotChecked=156, Total=552 [2022-11-16 12:15:46,319 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:15:46,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 283 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 82 Unchecked, 0.0s Time] [2022-11-16 12:15:46,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-16 12:15:46,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2022-11-16 12:15:46,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:15:46,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-11-16 12:15:46,350 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 14 [2022-11-16 12:15:46,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:15:46,351 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-11-16 12:15:46,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 20 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-16 12:15:46,352 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-11-16 12:15:46,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 12:15:46,354 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:15:46,354 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:15:46,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-16 12:15:46,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:46,560 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:15:46,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:15:46,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1911673028, now seen corresponding path program 1 times [2022-11-16 12:15:46,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:15:46,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952210504] [2022-11-16 12:15:46,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:46,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:15:46,568 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:15:46,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [902756988] [2022-11-16 12:15:46,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:46,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:15:46,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:15:46,570 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:15:46,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:15:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:46,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-16 12:15:46,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:16:45,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:16:45,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:17:24,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 139 [2022-11-16 12:17:24,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:24,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952210504] [2022-11-16 12:17:24,949 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:17:24,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902756988] [2022-11-16 12:17:24,949 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-16 12:17:24,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-16 12:17:25,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:17:25,150 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_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) 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-16 12:17:25,155 INFO L158 Benchmark]: Toolchain (without parser) took 629516.84ms. Allocated memory was 98.6MB in the beginning and 151.0MB in the end (delta: 52.4MB). Free memory was 56.8MB in the beginning and 44.5MB in the end (delta: 12.3MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2022-11-16 12:17:25,155 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 98.6MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:17:25,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.60ms. Allocated memory is still 98.6MB. Free memory was 56.6MB in the beginning and 73.4MB in the end (delta: -16.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 12:17:25,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.04ms. Allocated memory is still 98.6MB. Free memory was 73.4MB in the beginning and 71.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:17:25,156 INFO L158 Benchmark]: Boogie Preprocessor took 67.53ms. Allocated memory is still 98.6MB. Free memory was 71.6MB in the beginning and 70.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:17:25,157 INFO L158 Benchmark]: RCFGBuilder took 565.53ms. Allocated memory is still 98.6MB. Free memory was 70.1MB in the beginning and 57.7MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 12:17:25,157 INFO L158 Benchmark]: TraceAbstraction took 628432.22ms. Allocated memory was 98.6MB in the beginning and 151.0MB in the end (delta: 52.4MB). Free memory was 57.2MB in the beginning and 44.5MB in the end (delta: 12.7MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. [2022-11-16 12:17:25,159 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.42ms. Allocated memory is still 98.6MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.60ms. Allocated memory is still 98.6MB. Free memory was 56.6MB in the beginning and 73.4MB in the end (delta: -16.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.04ms. Allocated memory is still 98.6MB. Free memory was 73.4MB in the beginning and 71.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.53ms. Allocated memory is still 98.6MB. Free memory was 71.6MB in the beginning and 70.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 565.53ms. Allocated memory is still 98.6MB. Free memory was 70.1MB in the beginning and 57.7MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 628432.22ms. Allocated memory was 98.6MB in the beginning and 151.0MB in the end (delta: 52.4MB). Free memory was 57.2MB in the beginning and 44.5MB in the end (delta: 12.7MB). Peak memory consumption was 66.4MB. 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_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_3_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8 --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 cf7f7457cdd0c5557ed6396b1b77324a2673e1bc1f66f80f06950a47fe88485c --- 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-e04fb08 [2022-11-16 12:17:27,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:17:27,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:17:27,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:17:27,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:17:27,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:17:27,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:17:27,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:17:27,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:17:27,313 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:17:27,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:17:27,315 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:17:27,315 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:17:27,316 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:17:27,317 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:17:27,318 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:17:27,319 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:17:27,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:17:27,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:17:27,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:17:27,325 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:17:27,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:17:27,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:17:27,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:17:27,349 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:17:27,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:17:27,350 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:17:27,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:17:27,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:17:27,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:17:27,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:17:27,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:17:27,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:17:27,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:17:27,356 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:17:27,356 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:17:27,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:17:27,357 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:17:27,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:17:27,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:17:27,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:17:27,367 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-16 12:17:27,391 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:17:27,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:17:27,391 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:17:27,392 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:17:27,392 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:17:27,393 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:17:27,393 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:17:27,393 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:17:27,394 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:17:27,394 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:17:27,394 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:17:27,394 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:17:27,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:17:27,394 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:17:27,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:17:27,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:17:27,395 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:17:27,395 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 12:17:27,395 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 12:17:27,396 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:17:27,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:17:27,396 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:17:27,396 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:17:27,396 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:17:27,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:17:27,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:17:27,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:17:27,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:17:27,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:17:27,398 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:17:27,398 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 12:17:27,398 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 12:17:27,398 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:17:27,398 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:17:27,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:17:27,399 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 12:17:27,399 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_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8 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 -> cf7f7457cdd0c5557ed6396b1b77324a2673e1bc1f66f80f06950a47fe88485c [2022-11-16 12:17:27,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:17:27,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:17:27,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:17:27,791 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:17:27,791 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:17:27,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/combinations/gcd_2+newton_3_3.i [2022-11-16 12:17:27,880 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/data/1d42ce156/31b07c831ffe4a29a2003b30556b6f79/FLAG0fe50345f [2022-11-16 12:17:28,458 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:17:28,472 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i [2022-11-16 12:17:28,480 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/data/1d42ce156/31b07c831ffe4a29a2003b30556b6f79/FLAG0fe50345f [2022-11-16 12:17:28,824 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/data/1d42ce156/31b07c831ffe4a29a2003b30556b6f79 [2022-11-16 12:17:28,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:17:28,828 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:17:28,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:17:28,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:17:28,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:17:28,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:17:28" (1/1) ... [2022-11-16 12:17:28,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ee00c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:28, skipping insertion in model container [2022-11-16 12:17:28,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:17:28" (1/1) ... [2022-11-16 12:17:28,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:17:28,867 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:17:29,059 WARN L229 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_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i[1226,1239] [2022-11-16 12:17:29,082 WARN L229 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_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i[2862,2875] [2022-11-16 12:17:29,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:17:29,096 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:17:29,126 WARN L229 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_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i[1226,1239] [2022-11-16 12:17:29,144 WARN L229 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_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i[2862,2875] [2022-11-16 12:17:29,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:17:29,173 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:17:29,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:29 WrapperNode [2022-11-16 12:17:29,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:17:29,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:17:29,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:17:29,175 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:17:29,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:29" (1/1) ... [2022-11-16 12:17:29,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:29" (1/1) ... [2022-11-16 12:17:29,212 INFO L138 Inliner]: procedures = 28, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2022-11-16 12:17:29,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:17:29,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:17:29,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:17:29,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:17:29,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:29" (1/1) ... [2022-11-16 12:17:29,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:29" (1/1) ... [2022-11-16 12:17:29,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:29" (1/1) ... [2022-11-16 12:17:29,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:29" (1/1) ... [2022-11-16 12:17:29,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:29" (1/1) ... [2022-11-16 12:17:29,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:29" (1/1) ... [2022-11-16 12:17:29,240 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:29" (1/1) ... [2022-11-16 12:17:29,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:29" (1/1) ... [2022-11-16 12:17:29,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:17:29,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:17:29,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:17:29,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:17:29,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:29" (1/1) ... [2022-11-16 12:17:29,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:17:29,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:17:29,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:17:29,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:17:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:17:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 12:17:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-16 12:17:29,315 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-16 12:17:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-16 12:17:29,316 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-16 12:17:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:17:29,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:17:29,398 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:17:29,400 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:17:40,056 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:17:40,063 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:17:40,063 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 12:17:40,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:40 BoogieIcfgContainer [2022-11-16 12:17:40,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:17:40,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:17:40,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:17:40,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:17:40,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:17:28" (1/3) ... [2022-11-16 12:17:40,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec6b8b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:17:40, skipping insertion in model container [2022-11-16 12:17:40,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:17:29" (2/3) ... [2022-11-16 12:17:40,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec6b8b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:17:40, skipping insertion in model container [2022-11-16 12:17:40,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:17:40" (3/3) ... [2022-11-16 12:17:40,080 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_3.i [2022-11-16 12:17:40,101 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:17:40,101 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 12:17:40,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:17:40,167 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;@1b8c5dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:17:40,168 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-16 12:17:40,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:17:40,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 12:17:40,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:40,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:40,181 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:40,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:40,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-11-16 12:17:40,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:40,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159591841] [2022-11-16 12:17:40,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:40,199 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-16 12:17:40,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:40,207 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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-16 12:17:40,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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-16 12:17:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:40,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:17:40,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:40,496 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-16 12:17:40,497 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:40,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:40,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159591841] [2022-11-16 12:17:40,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159591841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:40,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:40,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:17:40,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083507913] [2022-11-16 12:17:40,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:40,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:40,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:40,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:40,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:40,539 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 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-16 12:17:40,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:40,568 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-11-16 12:17:40,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:40,570 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-16 12:17:40,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:40,578 INFO L225 Difference]: With dead ends: 74 [2022-11-16 12:17:40,578 INFO L226 Difference]: Without dead ends: 33 [2022-11-16 12:17:40,581 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-16 12:17:40,585 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 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-16 12:17:40,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-11-16 12:17:40,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-16 12:17:40,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-16 12:17:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:17:40,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-11-16 12:17:40,626 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 11 [2022-11-16 12:17:40,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:40,627 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-11-16 12:17:40,627 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-16 12:17:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-11-16 12:17:40,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 12:17:40,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:40,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:40,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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-16 12:17:40,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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-16 12:17:40,842 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:40,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:40,844 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2022-11-16 12:17:40,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:40,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644290722] [2022-11-16 12:17:40,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:40,850 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-16 12:17:40,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:40,852 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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-16 12:17:40,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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-16 12:17:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:40,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:17:40,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:41,078 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-16 12:17:41,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:41,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:41,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644290722] [2022-11-16 12:17:41,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644290722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:41,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:41,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:17:41,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465168292] [2022-11-16 12:17:41,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:41,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:17:41,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:41,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:17:41,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:17:41,083 INFO L87 Difference]: Start difference. First operand 33 states and 39 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-16 12:17:41,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:41,303 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-11-16 12:17:41,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:17:41,307 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-16 12:17:41,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:41,308 INFO L225 Difference]: With dead ends: 40 [2022-11-16 12:17:41,309 INFO L226 Difference]: Without dead ends: 34 [2022-11-16 12:17:41,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:17:41,310 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:41,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 99 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:17:41,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-16 12:17:41,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-11-16 12:17:41,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:17:41,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-11-16 12:17:41,318 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 11 [2022-11-16 12:17:41,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:41,319 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-11-16 12:17:41,319 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-16 12:17:41,319 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-11-16 12:17:41,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 12:17:41,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:41,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:41,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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)] Forceful destruction successful, exit code 0 [2022-11-16 12:17:41,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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-16 12:17:41,521 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:41,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:41,522 INFO L85 PathProgramCache]: Analyzing trace with hash 149955676, now seen corresponding path program 1 times [2022-11-16 12:17:41,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:41,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678265697] [2022-11-16 12:17:41,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:41,523 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-16 12:17:41,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:41,524 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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-16 12:17:41,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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-16 12:17:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:41,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:17:41,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:17:41,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:41,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:41,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678265697] [2022-11-16 12:17:41,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678265697] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:41,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:41,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:17:41,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039030205] [2022-11-16 12:17:41,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:41,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:17:41,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:41,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:17:41,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:17:41,800 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-16 12:17:41,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:41,922 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-11-16 12:17:41,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:17:41,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-16 12:17:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:41,925 INFO L225 Difference]: With dead ends: 41 [2022-11-16 12:17:41,925 INFO L226 Difference]: Without dead ends: 33 [2022-11-16 12:17:41,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-16 12:17:41,927 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:41,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 99 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:17:41,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-16 12:17:41,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-16 12:17:41,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:17:41,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-11-16 12:17:41,940 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 12 [2022-11-16 12:17:41,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:41,940 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-11-16 12:17:41,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-16 12:17:41,941 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-11-16 12:17:41,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 12:17:41,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:41,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:41,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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-16 12:17:42,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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-16 12:17:42,156 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:42,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:42,156 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2022-11-16 12:17:42,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:42,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86369107] [2022-11-16 12:17:42,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:42,157 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-16 12:17:42,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:42,158 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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-16 12:17:42,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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-16 12:17:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:42,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 12:17:42,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:42,886 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-16 12:17:42,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:17:43,700 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-16 12:17:43,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:43,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86369107] [2022-11-16 12:17:43,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86369107] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:17:43,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:17:43,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-16 12:17:43,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672045826] [2022-11-16 12:17:43,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:17:43,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:17:43,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:43,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:17:43,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:17:43,713 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 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-16 12:17:46,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:46,348 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-11-16 12:17:46,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 12:17:46,349 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 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-16 12:17:46,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:46,350 INFO L225 Difference]: With dead ends: 50 [2022-11-16 12:17:46,350 INFO L226 Difference]: Without dead ends: 36 [2022-11-16 12:17:46,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2022-11-16 12:17:46,352 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 32 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:46,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 265 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-16 12:17:46,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-16 12:17:46,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-11-16 12:17:46,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 12:17:46,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-11-16 12:17:46,368 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 12 [2022-11-16 12:17:46,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:46,369 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-11-16 12:17:46,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 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-16 12:17:46,371 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-11-16 12:17:46,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 12:17:46,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:46,372 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:46,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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-16 12:17:46,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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-16 12:17:46,580 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:17:46,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:46,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2084161321, now seen corresponding path program 2 times [2022-11-16 12:17:46,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:46,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495697370] [2022-11-16 12:17:46,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:17:46,583 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-16 12:17:46,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:46,584 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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-16 12:17:46,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea8c6d2e-ff32-4486-97ae-147aecd29cf1/bin/uautomizer-tPACEb0tL8/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-16 12:17:52,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:17:52,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:17:52,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 12:17:52,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:18:34,769 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-16 12:18:34,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:21:22,644 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-16 12:21:22,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:21:22,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495697370] [2022-11-16 12:21:22,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495697370] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:21:22,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:21:22,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-11-16 12:21:22,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212090074] [2022-11-16 12:21:22,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:21:22,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 12:21:22,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:21:22,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 12:21:22,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=428, Unknown=44, NotChecked=0, Total=552 [2022-11-16 12:21:22,647 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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-16 12:21:24,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-16 12:21:41,940 WARN L233 SmtUtils]: Spent 12.20s on a formula simplification. DAG size of input: 36 DAG size of output: 14 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:22:04,704 WARN L233 SmtUtils]: Spent 5.12s on a formula simplification. DAG size of input: 40 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)