./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_1+newton_2_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_1+newton_2_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a3e0b52eabe0a038e4774a376f7ed1eb95ce84c8d3569b2d9d7df15f27e8bd7 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:58:15,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:58:15,376 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:58:15,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:58:15,381 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:58:15,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:58:15,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:58:15,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:58:15,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:58:15,407 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:58:15,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:58:15,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:58:15,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:58:15,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:58:15,410 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:58:15,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:58:15,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:58:15,411 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:58:15,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:58:15,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:58:15,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:58:15,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:58:15,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:58:15,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:58:15,415 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:58:15,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:58:15,415 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:58:15,416 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:58:15,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:58:15,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:58:15,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:58:15,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:58:15,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:58:15,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:58:15,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:58:15,419 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:58:15,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:58:15,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:58:15,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:58:15,420 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:58:15,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:58:15,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:58:15,421 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/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_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a3e0b52eabe0a038e4774a376f7ed1eb95ce84c8d3569b2d9d7df15f27e8bd7 [2023-11-29 00:58:15,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:58:15,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:58:15,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:58:15,672 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:58:15,673 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:58:15,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/combinations/gcd_1+newton_2_3.i [2023-11-29 00:58:18,361 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:58:18,520 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:58:18,521 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/sv-benchmarks/c/combinations/gcd_1+newton_2_3.i [2023-11-29 00:58:18,530 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/data/cc21982b3/2ffc9a6e80b34c2f8a5739cbfd1405ca/FLAG692c7b59e [2023-11-29 00:58:18,544 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/data/cc21982b3/2ffc9a6e80b34c2f8a5739cbfd1405ca [2023-11-29 00:58:18,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:58:18,548 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:58:18,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:58:18,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:58:18,555 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:58:18,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:58:18" (1/1) ... [2023-11-29 00:58:18,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1513df01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:18, skipping insertion in model container [2023-11-29 00:58:18,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:58:18" (1/1) ... [2023-11-29 00:58:18,583 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:58:18,739 WARN L240 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_2767920a-8068-4dc3-9179-e308aafb9d4d/sv-benchmarks/c/combinations/gcd_1+newton_2_3.i[1226,1239] [2023-11-29 00:58:18,765 WARN L240 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_2767920a-8068-4dc3-9179-e308aafb9d4d/sv-benchmarks/c/combinations/gcd_1+newton_2_3.i[2807,2820] [2023-11-29 00:58:18,766 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:58:18,777 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:58:18,790 WARN L240 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_2767920a-8068-4dc3-9179-e308aafb9d4d/sv-benchmarks/c/combinations/gcd_1+newton_2_3.i[1226,1239] [2023-11-29 00:58:18,801 WARN L240 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_2767920a-8068-4dc3-9179-e308aafb9d4d/sv-benchmarks/c/combinations/gcd_1+newton_2_3.i[2807,2820] [2023-11-29 00:58:18,802 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:58:18,817 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:58:18,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:18 WrapperNode [2023-11-29 00:58:18,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:58:18,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:58:18,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:58:18,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:58:18,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:18" (1/1) ... [2023-11-29 00:58:18,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:18" (1/1) ... [2023-11-29 00:58:18,859 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 88 [2023-11-29 00:58:18,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:58:18,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:58:18,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:58:18,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:58:18,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:18" (1/1) ... [2023-11-29 00:58:18,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:18" (1/1) ... [2023-11-29 00:58:18,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:18" (1/1) ... [2023-11-29 00:58:18,885 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-11-29 00:58:18,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:18" (1/1) ... [2023-11-29 00:58:18,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:18" (1/1) ... [2023-11-29 00:58:18,891 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:18" (1/1) ... [2023-11-29 00:58:18,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:18" (1/1) ... [2023-11-29 00:58:18,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:18" (1/1) ... [2023-11-29 00:58:18,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:18" (1/1) ... [2023-11-29 00:58:18,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:58:18,901 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:58:18,901 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:58:18,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:58:18,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:18" (1/1) ... [2023-11-29 00:58:18,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:58:18,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:58:18,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:58:18,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:58:18,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:58:18,971 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-11-29 00:58:18,972 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-11-29 00:58:18,972 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-29 00:58:18,972 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-29 00:58:18,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:58:18,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:58:18,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:58:18,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:58:19,039 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:58:19,041 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:58:19,221 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:58:19,250 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:58:19,250 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:58:19,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:58:19 BoogieIcfgContainer [2023-11-29 00:58:19,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:58:19,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:58:19,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:58:19,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:58:19,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:58:18" (1/3) ... [2023-11-29 00:58:19,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230407b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:58:19, skipping insertion in model container [2023-11-29 00:58:19,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:58:18" (2/3) ... [2023-11-29 00:58:19,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230407b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:58:19, skipping insertion in model container [2023-11-29 00:58:19,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:58:19" (3/3) ... [2023-11-29 00:58:19,259 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_2_3.i [2023-11-29 00:58:19,277 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:58:19,277 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 00:58:19,320 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:58:19,325 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=LoopHeads, 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;@5ff77c41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:58:19,326 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-29 00:58:19,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 23 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 00:58:19,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 00:58:19,335 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:19,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:58:19,336 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:58:19,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:19,340 INFO L85 PathProgramCache]: Analyzing trace with hash -115348373, now seen corresponding path program 1 times [2023-11-29 00:58:19,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:58:19,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34964020] [2023-11-29 00:58:19,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:19,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:58:19,427 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:58:19,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [721502108] [2023-11-29 00:58:19,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:19,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:58:19,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:58:19,431 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:58:19,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:58:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:19,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 00:58:19,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:58:19,526 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:58:19,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:58:19,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34964020] [2023-11-29 00:58:19,527 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 00:58:19,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721502108] [2023-11-29 00:58:19,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721502108] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:58:19,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:58:19,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:58:19,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496348912] [2023-11-29 00:58:19,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:58:19,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:58:19,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:58:19,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:58:19,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:58:19,557 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 23 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2023-11-29 00:58:19,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:19,590 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2023-11-29 00:58:19,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:58:19,592 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2023-11-29 00:58:19,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:19,599 INFO L225 Difference]: With dead ends: 53 [2023-11-29 00:58:19,599 INFO L226 Difference]: Without dead ends: 25 [2023-11-29 00:58:19,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:58:19,606 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:19,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:58:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-29 00:58:19,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-29 00:58:19,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 00:58:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-11-29 00:58:19,642 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 9 [2023-11-29 00:58:19,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:19,642 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-11-29 00:58:19,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2023-11-29 00:58:19,643 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-11-29 00:58:19,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 00:58:19,644 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:19,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:58:19,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:58:19,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-29 00:58:19,845 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:58:19,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:19,846 INFO L85 PathProgramCache]: Analyzing trace with hash -115467537, now seen corresponding path program 1 times [2023-11-29 00:58:19,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:58:19,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461981800] [2023-11-29 00:58:19,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:19,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:58:19,862 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:58:19,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1069346495] [2023-11-29 00:58:19,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:19,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:58:19,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:58:19,864 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:58:19,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:58:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:19,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:58:19,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:58:19,965 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:58:19,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:58:19,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461981800] [2023-11-29 00:58:19,966 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 00:58:19,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069346495] [2023-11-29 00:58:19,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069346495] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:58:19,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:58:19,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:58:19,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799966428] [2023-11-29 00:58:19,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:58:19,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:58:19,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:58:19,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:58:19,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:58:19,969 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2023-11-29 00:58:19,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:19,989 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2023-11-29 00:58:19,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:58:19,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2023-11-29 00:58:19,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:19,991 INFO L225 Difference]: With dead ends: 31 [2023-11-29 00:58:19,991 INFO L226 Difference]: Without dead ends: 26 [2023-11-29 00:58:19,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:58:19,993 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:19,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 40 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:58:19,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-29 00:58:19,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-29 00:58:20,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 00:58:20,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-11-29 00:58:20,001 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 9 [2023-11-29 00:58:20,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:20,001 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-11-29 00:58:20,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2023-11-29 00:58:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-11-29 00:58:20,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 00:58:20,002 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:20,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:58:20,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 00:58:20,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:58:20,205 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:58:20,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:20,205 INFO L85 PathProgramCache]: Analyzing trace with hash 772550301, now seen corresponding path program 1 times [2023-11-29 00:58:20,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:58:20,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633147939] [2023-11-29 00:58:20,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:20,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:58:20,218 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:58:20,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1618687685] [2023-11-29 00:58:20,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:20,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:58:20,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:58:20,220 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:58:20,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 00:58:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:20,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 00:58:20,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:58:20,323 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:58:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:58:20,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:58:20,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633147939] [2023-11-29 00:58:20,353 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 00:58:20,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618687685] [2023-11-29 00:58:20,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618687685] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:58:20,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:58:20,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-11-29 00:58:20,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974722128] [2023-11-29 00:58:20,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:58:20,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:58:20,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:58:20,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:58:20,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:58:20,356 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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) [2023-11-29 00:58:20,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:20,407 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2023-11-29 00:58:20,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:58:20,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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 10 [2023-11-29 00:58:20,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:20,409 INFO L225 Difference]: With dead ends: 31 [2023-11-29 00:58:20,409 INFO L226 Difference]: Without dead ends: 27 [2023-11-29 00:58:20,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:58:20,410 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:20,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 99 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:58:20,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-29 00:58:20,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-29 00:58:20,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 00:58:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-11-29 00:58:20,418 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2023-11-29 00:58:20,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:20,418 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-11-29 00:58:20,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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) [2023-11-29 00:58:20,419 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-11-29 00:58:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 00:58:20,419 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:20,419 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:58:20,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 00:58:20,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:58:20,620 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:58:20,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:20,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1820926095, now seen corresponding path program 2 times [2023-11-29 00:58:20,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:58:20,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672492874] [2023-11-29 00:58:20,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:20,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:58:20,630 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 00:58:20,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [696044683] [2023-11-29 00:58:20,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:58:20,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:58:20,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:58:20,632 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:58:20,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2767920a-8068-4dc3-9179-e308aafb9d4d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 00:58:24,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:58:24,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:58:24,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-29 00:58:24,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:37,734 WARN L854 $PredicateComparison]: unable to prove that (and (<= 1 |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (v_y_1 Int)) (let ((.cse0 (* 256 v_y_1)) (.cse1 (* 255 |v_ULTIMATE.start_gcd_test_~a#1_19|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_19|) (= (mod (+ .cse0 .cse1) |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= (+ .cse0 .cse1 1) 0) (<= 0 (+ .cse0 .cse1 128)) (<= |v_ULTIMATE.start_gcd_test_~a#1_19| 127)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (v_y_3 Int)) (let ((.cse2 (* 255 |v_ULTIMATE.start_gcd_test_~a#1_19|)) (.cse3 (* 256 v_y_3))) (and (<= (+ .cse2 65281 .cse3) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_19|)) (= (mod (+ .cse2 65280 .cse3) |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_19| 1) 0) (<= 0 (+ 65408 .cse2 .cse3))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)))) is different from false [2023-11-29 00:58:54,465 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:59:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-29 00:59:32,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:00:19,277 WARN L293 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:00:30,626 WARN L293 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:00:51,626 WARN L293 SmtUtils]: Spent 6.88s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:01:43,382 WARN L293 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:01:52,918 WARN L293 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:02:46,720 WARN L293 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:03:05,102 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:03:11,122 WARN L293 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:03:15,151 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse26 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse28 (mod (+ .cse26 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse27 (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse19 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 0))) (.cse21 (= .cse27 0)) (.cse23 (= .cse28 0)) (.cse24 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0))) (.cse9 (< 0 .cse25))) (let ((.cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0))) (.cse0 (< .cse28 128)) (.cse10 (< 127 .cse28)) (.cse5 (< .cse27 128)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse12 (or .cse23 .cse24 .cse9)) (.cse13 (or .cse19 .cse21 .cse9)) (.cse1 (< 127 .cse27)) (.cse14 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse15 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse27)) 256) 0))) (.cse16 (mod .cse26 256))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse16)) 256) 0)) (< |c_ULTIMATE.start_gcd_test_~a#1| 0)))) (let ((.cse4 (or .cse14 (and (or .cse15 .cse9) .cse7))) (.cse3 (or (and .cse7 .cse13) .cse14))) (and (or .cse0 (let ((.cse2 (or .cse6 (and .cse7 (or .cse8 .cse9))))) (and (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse2) .cse5)))) (or .cse10 (let ((.cse11 (or (and .cse7 .cse12) .cse6))) (and (or .cse5 (and .cse11 .cse4)) (or (and .cse11 .cse3) .cse1))))))) (< .cse16 128)) (or (< 127 .cse16) (let ((.cse20 (= .cse26 0))) (let ((.cse18 (or (and (<= .cse25 0) (not .cse20)) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse16) 256) 0)) (= .cse16 0)))) (let ((.cse22 (or .cse14 (and .cse18 (or .cse20 .cse15 .cse9))))) (and (or (let ((.cse17 (or (and .cse18 (or .cse20 .cse8 .cse9)) .cse6))) (and (or .cse1 (and .cse17 (or .cse14 (and .cse18 (or .cse19 .cse20 .cse21 .cse9))))) (or (and .cse17 .cse22) .cse5))) .cse0) (or .cse10 (and (or (and (or (and (or .cse20 .cse23 .cse24 .cse9) .cse18) .cse6) .cse22) .cse5) (or (and (or .cse6 (and .cse18 .cse12)) (or (and .cse13 .cse18) .cse14)) .cse1))))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from false [2023-11-29 01:04:16,767 WARN L293 SmtUtils]: Spent 20.65s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:04:48,246 WARN L293 SmtUtils]: Spent 5.95s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:05:13,035 WARN L876 $PredicateComparison]: unable to prove that (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse0 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (and (let ((.cse1 (mod (mod .cse0 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (< 127 .cse0) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse1) 256) 0)) (= .cse1 0))) (let ((.cse2 (mod (+ .cse0 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (< .cse0 128) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse2 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) (= .cse2 0))))) (< 0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (< |c_ULTIMATE.start_main1_~y~0#1| 1)) is different from true [2023-11-29 01:05:25,066 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:06:03,832 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:06:22,449 WARN L293 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:06:37,061 WARN L293 SmtUtils]: Spent 6.53s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:06:41,065 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main1_~y~0#1_11| Int) (v_z_7 Int) (v_y_7 Int)) (let ((.cse0 (mod (mod v_z_7 |v_ULTIMATE.start_main1_~y~0#1_11|) 256)) (.cse1 (* 255 v_z_7)) (.cse2 (* 256 v_y_7))) (or (= .cse0 0) (not (= (mod (mod |v_ULTIMATE.start_main1_~y~0#1_11| .cse0) 256) 0)) (< v_z_7 0) (< (+ .cse1 128 .cse2) 0) (< 0 (+ .cse1 .cse2 1)) (< |v_ULTIMATE.start_main1_~y~0#1_11| 1) (not (= (mod (+ .cse1 .cse2) |v_ULTIMATE.start_main1_~y~0#1_11|) 0)) (< 127 v_z_7)))) is different from false [2023-11-29 01:06:45,068 WARN L876 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main1_~y~0#1_11| Int) (v_z_7 Int) (v_y_7 Int)) (let ((.cse0 (mod (mod v_z_7 |v_ULTIMATE.start_main1_~y~0#1_11|) 256)) (.cse1 (* 255 v_z_7)) (.cse2 (* 256 v_y_7))) (or (= .cse0 0) (not (= (mod (mod |v_ULTIMATE.start_main1_~y~0#1_11| .cse0) 256) 0)) (< v_z_7 0) (< (+ .cse1 128 .cse2) 0) (< 0 (+ .cse1 .cse2 1)) (< |v_ULTIMATE.start_main1_~y~0#1_11| 1) (not (= (mod (+ .cse1 .cse2) |v_ULTIMATE.start_main1_~y~0#1_11|) 0)) (< 127 v_z_7)))) is different from true [2023-11-29 01:06:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 01:06:45,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:06:45,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672492874] [2023-11-29 01:06:45,069 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 01:06:45,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696044683] [2023-11-29 01:06:45,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696044683] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:06:45,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:06:45,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2023-11-29 01:06:45,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175708655] [2023-11-29 01:06:45,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:06:45,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 01:06:45,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:06:45,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 01:06:45,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=67, Unknown=9, NotChecked=76, Total=182 [2023-11-29 01:06:45,071 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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) [2023-11-29 01:06:47,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 01:07:31,587 WARN L293 SmtUtils]: Spent 30.66s on a formula simplification. DAG size of input: 46 DAG size of output: 29 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:07:57,417 WARN L293 SmtUtils]: Spent 19.73s on a formula simplification. DAG size of input: 53 DAG size of output: 20 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:08:01,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 01:08:56,623 WARN L293 SmtUtils]: Spent 42.34s on a formula simplification. DAG size of input: 107 DAG size of output: 60 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:09:01,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 01:09:05,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 01:09:09,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 01:09:38,750 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse25 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse26 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (= .cse26 0)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse30 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse9 (< 0 .cse25)) (.cse29 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or (let ((.cse28 (mod (+ .cse26 .cse29) 256)) (.cse27 (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse19 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 0))) (.cse21 (= .cse27 0)) (.cse23 (= .cse28 0)) (.cse24 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0)))) (let ((.cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0))) (.cse0 (< .cse28 128)) (.cse10 (< 127 .cse28)) (.cse5 (< .cse27 128)) (.cse12 (or .cse23 .cse24 .cse9)) (.cse13 (or .cse19 .cse21 .cse9)) (.cse1 (< 127 .cse27)) (.cse14 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse15 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse27)) 256) 0))) (.cse16 (mod .cse26 256))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse16)) 256) 0)) (< |c_ULTIMATE.start_gcd_test_~a#1| 0)))) (let ((.cse4 (or .cse14 (and (or .cse15 .cse9) .cse7))) (.cse3 (or (and .cse7 .cse13) .cse14))) (and (or .cse0 (let ((.cse2 (or .cse6 (and .cse7 (or .cse8 .cse9))))) (and (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse2) .cse5)))) (or .cse10 (let ((.cse11 (or (and .cse7 .cse12) .cse6))) (and (or .cse5 (and .cse11 .cse4)) (or (and .cse11 .cse3) .cse1))))))) (< .cse16 128)) (or (< 127 .cse16) (let ((.cse18 (or (and (<= .cse25 0) (not .cse20)) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse16) 256) 0)) (= .cse16 0)))) (let ((.cse22 (or .cse14 (and .cse18 (or .cse20 .cse15 .cse9))))) (and (or (let ((.cse17 (or (and .cse18 (or .cse20 .cse8 .cse9)) .cse6))) (and (or .cse1 (and .cse17 (or .cse14 (and .cse18 (or .cse19 .cse20 .cse21 .cse9))))) (or (and .cse17 .cse22) .cse5))) .cse0) (or .cse10 (and (or (and (or (and (or .cse20 .cse23 .cse24 .cse9) .cse18) .cse6) .cse22) .cse5) (or (and (or .cse6 (and .cse18 .cse12)) (or (and .cse13 .cse18) .cse14)) .cse1))))))))))) .cse30) (<= |c_ULTIMATE.start_main1_~x~0#1| 127) .cse20 (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (or .cse6 .cse30 .cse9 (let ((.cse31 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse32 (mod (mod .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< 127 .cse31) (= 0 .cse32) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse32) 256) 0)))) (let ((.cse33 (mod (+ .cse31 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse33 .cse29) 256))) 256) 0)) (= .cse33 0) (< .cse31 128)))))) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (<= 1 |c_ULTIMATE.start_gcd_test_~b#1|)))) is different from true [2023-11-29 01:09:42,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 01:10:29,858 WARN L293 SmtUtils]: Spent 35.62s on a formula simplification. DAG size of input: 94 DAG size of output: 61 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 01:10:34,809 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod .cse15 256))) (let ((.cse2 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse6 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse17 (= .cse7 0)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or .cse0 .cse1 .cse2 (let ((.cse3 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse4 (mod (mod .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< 127 .cse3) (= 0 .cse4) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 0)))) (let ((.cse5 (mod (+ .cse3 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse5 .cse6) 256))) 256) 0)) (= .cse5 0) (< .cse3 128)))))) (or (let ((.cse19 (mod (+ .cse15 .cse6) 256))) (let ((.cse13 (< .cse19 128)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse19)) 256) 0))) (.cse8 (< 127 .cse19)) (.cse11 (= .cse19 0)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0))) (.cse16 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (and (or (< 127 .cse7) (let ((.cse9 (or .cse16 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 0)) .cse17)) (.cse10 (= .cse15 0))) (and (or .cse8 (and .cse9 (or .cse10 .cse11 .cse12 .cse2))) (or .cse13 (and .cse9 (or .cse10 .cse14 .cse2)))))) (or (let ((.cse18 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse7)) 256) 0)) .cse16))) (and (or .cse13 (and .cse18 (or .cse14 .cse2))) (or .cse8 (and .cse18 (or .cse11 .cse12 .cse2))))) (< .cse7 128))))) .cse0 .cse1) (or (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< (+ |c_ULTIMATE.start_gcd_test_~a#1| 128) 0)) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (not .cse17) (< (+ |c_ULTIMATE.start_gcd_test_~b#1| 128) 0) .cse1))))) is different from false [2023-11-29 01:10:38,818 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse15 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod .cse15 256))) (let ((.cse2 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse6 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse17 (= .cse7 0)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or .cse0 .cse1 .cse2 (let ((.cse3 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse4 (mod (mod .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< 127 .cse3) (= 0 .cse4) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 0)))) (let ((.cse5 (mod (+ .cse3 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse5 .cse6) 256))) 256) 0)) (= .cse5 0) (< .cse3 128)))))) (or (let ((.cse19 (mod (+ .cse15 .cse6) 256))) (let ((.cse13 (< .cse19 128)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse19)) 256) 0))) (.cse8 (< 127 .cse19)) (.cse11 (= .cse19 0)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0))) (.cse16 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (and (or (< 127 .cse7) (let ((.cse9 (or .cse16 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 0)) .cse17)) (.cse10 (= .cse15 0))) (and (or .cse8 (and .cse9 (or .cse10 .cse11 .cse12 .cse2))) (or .cse13 (and .cse9 (or .cse10 .cse14 .cse2)))))) (or (let ((.cse18 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse7)) 256) 0)) .cse16))) (and (or .cse13 (and .cse18 (or .cse14 .cse2))) (or .cse8 (and .cse18 (or .cse11 .cse12 .cse2))))) (< .cse7 128))))) .cse0 .cse1) (or (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< (+ |c_ULTIMATE.start_gcd_test_~a#1| 128) 0)) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (not .cse17) (< (+ |c_ULTIMATE.start_gcd_test_~b#1| 128) 0) .cse1))))) is different from true