./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d29c75fd5928e2fd79a32667a60cd8af89d36d3bace71f12987f1807282a833 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:16:20,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:16:21,052 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 01:16:21,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:16:21,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:16:21,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:16:21,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:16:21,110 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:16:21,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:16:21,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:16:21,115 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:16:21,116 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:16:21,116 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:16:21,117 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 01:16:21,117 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:16:21,117 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:16:21,118 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 01:16:21,118 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 01:16:21,118 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:16:21,119 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 01:16:21,119 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 01:16:21,125 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 01:16:21,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:16:21,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:16:21,127 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:16:21,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:16:21,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:16:21,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:16:21,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:16:21,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:16:21,129 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:16:21,130 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:16:21,131 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:16:21,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:16:21,132 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:16:21,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:16:21,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:16:21,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:16:21,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:16:21,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:16:21,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:16:21,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:16:21,134 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 01:16:21,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:16:21,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:16:21,135 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:16:21,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:16:21,136 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/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_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje 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 -> Taipan 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 -> 0d29c75fd5928e2fd79a32667a60cd8af89d36d3bace71f12987f1807282a833 [2024-11-09 01:16:21,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:16:21,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:16:21,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:16:21,449 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:16:21,449 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:16:21,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c Unable to find full path for "g++" [2024-11-09 01:16:23,501 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:16:23,701 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:16:23,702 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c [2024-11-09 01:16:23,714 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/data/f5e5dfeb4/8d663783241a4494aeb1b52104eec811/FLAGce5ef1ec8 [2024-11-09 01:16:23,745 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/data/f5e5dfeb4/8d663783241a4494aeb1b52104eec811 [2024-11-09 01:16:23,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:16:23,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:16:23,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:16:23,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:16:23,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:16:23,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:16:23" (1/1) ... [2024-11-09 01:16:23,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@596e03c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:23, skipping insertion in model container [2024-11-09 01:16:23,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:16:23" (1/1) ... [2024-11-09 01:16:23,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:16:24,016 WARN L250 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_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-09 01:16:24,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:16:24,066 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:16:24,079 WARN L250 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_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-09 01:16:24,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:16:24,116 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:16:24,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:24 WrapperNode [2024-11-09 01:16:24,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:16:24,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:16:24,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:16:24,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:16:24,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:24" (1/1) ... [2024-11-09 01:16:24,137 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:24" (1/1) ... [2024-11-09 01:16:24,168 INFO L138 Inliner]: procedures = 18, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 200 [2024-11-09 01:16:24,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:16:24,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:16:24,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:16:24,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:16:24,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:24" (1/1) ... [2024-11-09 01:16:24,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:24" (1/1) ... [2024-11-09 01:16:24,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:24" (1/1) ... [2024-11-09 01:16:24,183 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:24" (1/1) ... [2024-11-09 01:16:24,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:24" (1/1) ... [2024-11-09 01:16:24,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:24" (1/1) ... [2024-11-09 01:16:24,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:24" (1/1) ... [2024-11-09 01:16:24,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:24" (1/1) ... [2024-11-09 01:16:24,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:16:24,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:16:24,200 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:16:24,200 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:16:24,201 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:24" (1/1) ... [2024-11-09 01:16:24,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:16:24,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:16:24,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:16:24,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:16:24,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:16:24,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 01:16:24,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 01:16:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:16:24,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:16:24,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 01:16:24,287 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_0 [2024-11-09 01:16:24,287 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_0 [2024-11-09 01:16:24,287 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_1 [2024-11-09 01:16:24,287 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_1 [2024-11-09 01:16:24,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 01:16:24,400 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:16:24,402 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:16:24,784 INFO L? ?]: Removed 80 outVars from TransFormulas that were not future-live. [2024-11-09 01:16:24,785 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:16:24,887 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:16:24,888 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 01:16:24,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:16:24 BoogieIcfgContainer [2024-11-09 01:16:24,889 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:16:24,893 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:16:24,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:16:24,897 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:16:24,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:16:23" (1/3) ... [2024-11-09 01:16:24,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ce6f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:16:24, skipping insertion in model container [2024-11-09 01:16:24,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:24" (2/3) ... [2024-11-09 01:16:24,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ce6f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:16:24, skipping insertion in model container [2024-11-09 01:16:24,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:16:24" (3/3) ... [2024-11-09 01:16:24,903 INFO L112 eAbstractionObserver]: Analyzing ICFG color-sendmoremoney.c [2024-11-09 01:16:24,928 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:16:24,928 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:16:25,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:16:25,040 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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;@7b9656e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:16:25,040 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:16:25,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 01:16:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 01:16:25,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:25,069 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:16:25,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:16:25,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:25,078 INFO L85 PathProgramCache]: Analyzing trace with hash 885679062, now seen corresponding path program 1 times [2024-11-09 01:16:25,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:16:25,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773185344] [2024-11-09 01:16:25,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:25,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:16:25,524 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:16:25,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773185344] [2024-11-09 01:16:25,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773185344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:16:25,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:16:25,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:16:25,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355977013] [2024-11-09 01:16:25,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:16:25,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:16:25,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:16:25,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:16:25,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:16:25,557 INFO L87 Difference]: Start difference. First operand has 50 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 01:16:25,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:16:25,625 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2024-11-09 01:16:25,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:16:25,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-09 01:16:25,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:16:25,641 INFO L225 Difference]: With dead ends: 56 [2024-11-09 01:16:25,641 INFO L226 Difference]: Without dead ends: 48 [2024-11-09 01:16:25,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:16:25,649 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:16:25,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:16:25,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-09 01:16:25,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-09 01:16:25,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 01:16:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2024-11-09 01:16:25,695 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 23 [2024-11-09 01:16:25,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:16:25,696 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2024-11-09 01:16:25,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 01:16:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2024-11-09 01:16:25,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 01:16:25,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:25,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:16:25,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:16:25,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:16:25,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:25,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1649310606, now seen corresponding path program 1 times [2024-11-09 01:16:25,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:16:25,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357999737] [2024-11-09 01:16:25,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:25,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:16:25,876 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:16:25,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357999737] [2024-11-09 01:16:25,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357999737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:16:25,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:16:25,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:16:25,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586083893] [2024-11-09 01:16:25,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:16:25,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:16:25,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:16:25,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:16:25,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:16:25,881 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 01:16:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:16:25,933 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2024-11-09 01:16:25,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:16:25,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-09 01:16:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:16:25,935 INFO L225 Difference]: With dead ends: 61 [2024-11-09 01:16:25,935 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 01:16:25,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:16:25,937 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 8 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:16:25,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 109 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:16:25,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 01:16:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2024-11-09 01:16:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 01:16:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2024-11-09 01:16:25,946 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 26 [2024-11-09 01:16:25,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:16:25,946 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2024-11-09 01:16:25,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 01:16:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2024-11-09 01:16:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 01:16:25,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:25,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:16:25,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:16:25,948 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:16:25,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:25,949 INFO L85 PathProgramCache]: Analyzing trace with hash -463480061, now seen corresponding path program 1 times [2024-11-09 01:16:25,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:16:25,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114822669] [2024-11-09 01:16:25,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:25,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:16:26,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:16:26,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114822669] [2024-11-09 01:16:26,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114822669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:16:26,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:16:26,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:16:26,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145925828] [2024-11-09 01:16:26,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:16:26,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:16:26,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:16:26,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:16:26,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:16:26,094 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 01:16:26,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:16:26,131 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2024-11-09 01:16:26,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:16:26,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-11-09 01:16:26,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:16:26,134 INFO L225 Difference]: With dead ends: 66 [2024-11-09 01:16:26,134 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 01:16:26,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:16:26,136 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:16:26,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:16:26,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 01:16:26,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-09 01:16:26,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 01:16:26,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2024-11-09 01:16:26,149 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 29 [2024-11-09 01:16:26,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:16:26,149 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-11-09 01:16:26,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 01:16:26,150 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2024-11-09 01:16:26,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 01:16:26,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:26,154 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:16:26,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:16:26,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:16:26,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:26,155 INFO L85 PathProgramCache]: Analyzing trace with hash 828653817, now seen corresponding path program 1 times [2024-11-09 01:16:26,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:16:26,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437459279] [2024-11-09 01:16:26,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:26,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:26,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:16:26,382 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:16:26,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437459279] [2024-11-09 01:16:26,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437459279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:16:26,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:16:26,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:16:26,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337358002] [2024-11-09 01:16:26,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:16:26,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:16:26,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:16:26,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:16:26,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:16:26,385 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 01:16:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:16:26,452 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2024-11-09 01:16:26,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:16:26,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-11-09 01:16:26,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:16:26,454 INFO L225 Difference]: With dead ends: 72 [2024-11-09 01:16:26,456 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 01:16:26,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:16:26,458 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:16:26,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:16:26,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 01:16:26,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-09 01:16:26,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 01:16:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2024-11-09 01:16:26,474 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 33 [2024-11-09 01:16:26,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:16:26,474 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2024-11-09 01:16:26,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 01:16:26,475 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2024-11-09 01:16:26,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 01:16:26,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:26,476 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:16:26,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:16:26,476 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:16:26,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:26,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1613346476, now seen corresponding path program 1 times [2024-11-09 01:16:26,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:16:26,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529576297] [2024-11-09 01:16:26,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:26,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:26,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 01:16:26,617 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:16:26,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529576297] [2024-11-09 01:16:26,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529576297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:16:26,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:16:26,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:16:26,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162057044] [2024-11-09 01:16:26,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:16:26,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:16:26,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:16:26,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:16:26,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:16:26,624 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 01:16:26,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:16:26,707 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2024-11-09 01:16:26,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:16:26,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-09 01:16:26,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:16:26,712 INFO L225 Difference]: With dead ends: 82 [2024-11-09 01:16:26,712 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 01:16:26,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:16:26,714 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:16:26,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:16:26,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 01:16:26,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-09 01:16:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 01:16:26,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2024-11-09 01:16:26,730 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 37 [2024-11-09 01:16:26,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:16:26,731 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2024-11-09 01:16:26,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 01:16:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2024-11-09 01:16:26,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 01:16:26,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:26,733 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:16:26,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:16:26,734 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:16:26,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:26,734 INFO L85 PathProgramCache]: Analyzing trace with hash 410465180, now seen corresponding path program 1 times [2024-11-09 01:16:26,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:16:26,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334258993] [2024-11-09 01:16:26,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:26,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:26,815 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 01:16:26,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:16:26,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334258993] [2024-11-09 01:16:26,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334258993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:16:26,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:16:26,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:16:26,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141954399] [2024-11-09 01:16:26,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:16:26,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:16:26,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:16:26,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:16:26,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:16:26,818 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 01:16:26,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:16:26,851 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2024-11-09 01:16:26,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:16:26,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2024-11-09 01:16:26,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:16:26,853 INFO L225 Difference]: With dead ends: 86 [2024-11-09 01:16:26,853 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 01:16:26,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:16:26,854 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:16:26,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:16:26,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 01:16:26,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-09 01:16:26,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 01:16:26,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2024-11-09 01:16:26,862 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 45 [2024-11-09 01:16:26,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:16:26,862 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2024-11-09 01:16:26,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 01:16:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2024-11-09 01:16:26,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 01:16:26,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:26,864 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:16:26,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:16:26,865 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:16:26,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:26,865 INFO L85 PathProgramCache]: Analyzing trace with hash -404470234, now seen corresponding path program 1 times [2024-11-09 01:16:26,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:16:26,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053667646] [2024-11-09 01:16:26,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:26,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 01:16:26,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:16:26,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053667646] [2024-11-09 01:16:26,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053667646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:16:26,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:16:26,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:16:26,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716405861] [2024-11-09 01:16:26,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:16:26,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:16:26,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:16:26,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:16:26,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:16:26,980 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 01:16:27,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:16:27,017 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2024-11-09 01:16:27,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:16:27,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2024-11-09 01:16:27,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:16:27,018 INFO L225 Difference]: With dead ends: 90 [2024-11-09 01:16:27,019 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 01:16:27,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:16:27,020 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:16:27,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:16:27,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 01:16:27,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-09 01:16:27,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 01:16:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2024-11-09 01:16:27,034 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 49 [2024-11-09 01:16:27,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:16:27,034 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2024-11-09 01:16:27,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 01:16:27,035 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2024-11-09 01:16:27,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 01:16:27,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:27,039 INFO L215 NwaCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:16:27,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:16:27,039 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:16:27,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:27,040 INFO L85 PathProgramCache]: Analyzing trace with hash -969286379, now seen corresponding path program 1 times [2024-11-09 01:16:27,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:16:27,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613138544] [2024-11-09 01:16:27,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:27,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 01:16:27,168 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:16:27,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613138544] [2024-11-09 01:16:27,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613138544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:16:27,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:16:27,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:16:27,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371985044] [2024-11-09 01:16:27,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:16:27,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:16:27,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:16:27,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:16:27,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:16:27,173 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 01:16:27,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:16:27,220 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2024-11-09 01:16:27,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:16:27,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2024-11-09 01:16:27,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:16:27,221 INFO L225 Difference]: With dead ends: 94 [2024-11-09 01:16:27,222 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 01:16:27,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:16:27,223 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:16:27,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:16:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 01:16:27,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-09 01:16:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 01:16:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2024-11-09 01:16:27,236 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 53 [2024-11-09 01:16:27,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:16:27,237 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2024-11-09 01:16:27,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 01:16:27,237 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2024-11-09 01:16:27,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 01:16:27,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:27,240 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:16:27,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:16:27,243 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:16:27,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:27,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1417557783, now seen corresponding path program 1 times [2024-11-09 01:16:27,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:16:27,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660479800] [2024-11-09 01:16:27,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:27,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 01:16:27,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:16:27,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660479800] [2024-11-09 01:16:27,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660479800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:16:27,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:16:27,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:16:27,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891639925] [2024-11-09 01:16:27,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:16:27,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:16:27,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:16:27,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:16:27,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:16:27,452 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 01:16:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:16:27,489 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2024-11-09 01:16:27,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:16:27,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2024-11-09 01:16:27,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:16:27,490 INFO L225 Difference]: With dead ends: 55 [2024-11-09 01:16:27,490 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 01:16:27,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:16:27,491 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:16:27,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:16:27,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 01:16:27,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-09 01:16:27,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 01:16:27,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2024-11-09 01:16:27,503 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 57 [2024-11-09 01:16:27,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:16:27,504 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2024-11-09 01:16:27,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 01:16:27,504 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2024-11-09 01:16:27,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 01:16:27,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:27,505 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:16:27,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:16:27,505 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:16:27,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:27,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1932774797, now seen corresponding path program 1 times [2024-11-09 01:16:27,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:16:27,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436592411] [2024-11-09 01:16:27,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:27,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 01:16:27,633 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:16:27,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436592411] [2024-11-09 01:16:27,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436592411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:16:27,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:16:27,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:16:27,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259489238] [2024-11-09 01:16:27,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:16:27,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:16:27,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:16:27,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:16:27,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:16:27,637 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 01:16:27,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:16:27,694 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2024-11-09 01:16:27,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:16:27,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 58 [2024-11-09 01:16:27,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:16:27,695 INFO L225 Difference]: With dead ends: 69 [2024-11-09 01:16:27,695 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 01:16:27,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:16:27,696 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:16:27,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 131 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:16:27,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 01:16:27,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2024-11-09 01:16:27,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 01:16:27,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2024-11-09 01:16:27,704 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 58 [2024-11-09 01:16:27,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:16:27,704 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2024-11-09 01:16:27,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 01:16:27,705 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2024-11-09 01:16:27,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 01:16:27,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:27,706 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:16:27,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 01:16:27,706 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:16:27,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:27,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1679685457, now seen corresponding path program 1 times [2024-11-09 01:16:27,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:16:27,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067039314] [2024-11-09 01:16:27,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:27,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 01:16:27,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:16:27,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067039314] [2024-11-09 01:16:27,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067039314] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:16:27,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304500633] [2024-11-09 01:16:27,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:27,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:16:27,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:16:27,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:16:27,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:16:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:27,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:16:27,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:16:28,072 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 01:16:28,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:16:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 01:16:28,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304500633] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:16:28,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1974338956] [2024-11-09 01:16:28,209 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2024-11-09 01:16:28,209 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:16:28,213 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:16:28,220 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:16:28,220 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:16:30,915 INFO L197 IcfgInterpreter]: Interpreting procedure check_domain_1 with input of size 47 for LOIs [2024-11-09 01:16:30,928 INFO L197 IcfgInterpreter]: Interpreting procedure check_domain_0 with input of size 11 for LOIs [2024-11-09 01:16:30,933 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:16:35,142 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2054#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_#valid_13| (Array Int Int)) (|v_ULTIMATE.start_check_diff_~#d~0#1.base_11| Int)) (and (= (store |v_#valid_13| |v_ULTIMATE.start_check_diff_~#d~0#1.base_11| 0) |#valid|) (<= 2 |v_ULTIMATE.start_check_diff_~#d~0#1.base_11|))))' at error location [2024-11-09 01:16:35,143 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:16:35,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:16:35,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-11-09 01:16:35,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191001021] [2024-11-09 01:16:35,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:16:35,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:16:35,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:16:35,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:16:35,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1119, Unknown=21, NotChecked=0, Total=1260 [2024-11-09 01:16:35,146 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 01:16:35,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:16:35,478 INFO L93 Difference]: Finished difference Result 100 states and 136 transitions. [2024-11-09 01:16:35,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 01:16:35,479 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2024-11-09 01:16:35,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:16:35,480 INFO L225 Difference]: With dead ends: 100 [2024-11-09 01:16:35,480 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 01:16:35,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 131 SyntacticMatches, 20 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=212, Invalid=1747, Unknown=21, NotChecked=0, Total=1980 [2024-11-09 01:16:35,482 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 46 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:16:35,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 215 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:16:35,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 01:16:35,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2024-11-09 01:16:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 72 states have internal predecessors, (77), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 01:16:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2024-11-09 01:16:35,489 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 61 [2024-11-09 01:16:35,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:16:35,489 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2024-11-09 01:16:35,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 01:16:35,490 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2024-11-09 01:16:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 01:16:35,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:35,491 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:16:35,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:16:35,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 01:16:35,692 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:16:35,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:35,692 INFO L85 PathProgramCache]: Analyzing trace with hash 411004943, now seen corresponding path program 2 times [2024-11-09 01:16:35,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:16:35,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875684637] [2024-11-09 01:16:35,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:35,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 80 proven. 22 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-09 01:16:35,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:16:35,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875684637] [2024-11-09 01:16:35,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875684637] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:16:35,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045807702] [2024-11-09 01:16:35,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 01:16:35,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:16:35,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:16:35,956 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:16:35,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:16:36,102 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 01:16:36,102 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:16:36,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:16:36,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:16:36,164 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 62 proven. 3 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-09 01:16:36,164 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:16:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-09 01:16:36,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045807702] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:16:36,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:16:36,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 14 [2024-11-09 01:16:36,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186996336] [2024-11-09 01:16:36,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:16:36,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:16:36,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:16:36,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:16:36,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:16:36,262 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 01:16:36,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:16:36,342 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2024-11-09 01:16:36,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:16:36,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 93 [2024-11-09 01:16:36,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:16:36,343 INFO L225 Difference]: With dead ends: 95 [2024-11-09 01:16:36,343 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 01:16:36,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 179 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:16:36,344 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 9 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:16:36,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 167 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:16:36,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 01:16:36,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 01:16:36,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.064102564102564) internal successors, (83), 78 states have internal predecessors, (83), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 01:16:36,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2024-11-09 01:16:36,351 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 93 [2024-11-09 01:16:36,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:16:36,352 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2024-11-09 01:16:36,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 01:16:36,352 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2024-11-09 01:16:36,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 01:16:36,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:36,353 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:16:36,379 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 01:16:36,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 01:16:36,558 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:16:36,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:36,558 INFO L85 PathProgramCache]: Analyzing trace with hash -760105076, now seen corresponding path program 3 times [2024-11-09 01:16:36,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:16:36,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748071042] [2024-11-09 01:16:36,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:36,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 100 proven. 22 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-09 01:16:36,804 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:16:36,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748071042] [2024-11-09 01:16:36,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748071042] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:16:36,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800198549] [2024-11-09 01:16:36,804 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 01:16:36,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:16:36,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:16:36,807 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:16:36,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 01:16:36,947 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 01:16:36,947 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:16:36,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 01:16:36,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:16:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 100 proven. 22 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-09 01:16:37,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:16:37,143 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 100 proven. 22 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-09 01:16:37,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800198549] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:16:37,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [415558789] [2024-11-09 01:16:37,146 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2024-11-09 01:16:37,147 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:16:37,147 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:16:37,147 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:16:37,148 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:16:38,667 INFO L197 IcfgInterpreter]: Interpreting procedure check_domain_1 with input of size 47 for LOIs [2024-11-09 01:16:38,676 INFO L197 IcfgInterpreter]: Interpreting procedure check_domain_0 with input of size 11 for LOIs [2024-11-09 01:16:38,680 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:16:42,034 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3768#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_check_diff_~#d~0#1.base_15| Int) (|v_#valid_18| (Array Int Int))) (and (<= 2 |v_ULTIMATE.start_check_diff_~#d~0#1.base_15|) (= |#valid| (store |v_#valid_18| |v_ULTIMATE.start_check_diff_~#d~0#1.base_15| 0)))))' at error location [2024-11-09 01:16:42,035 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:16:42,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:16:42,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-11-09 01:16:42,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829145154] [2024-11-09 01:16:42,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:16:42,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 01:16:42,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:16:42,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 01:16:42,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1589, Unknown=21, NotChecked=0, Total=1806 [2024-11-09 01:16:42,041 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 01:16:42,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:16:42,284 INFO L93 Difference]: Finished difference Result 142 states and 160 transitions. [2024-11-09 01:16:42,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 01:16:42,284 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 100 [2024-11-09 01:16:42,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:16:42,285 INFO L225 Difference]: With dead ends: 142 [2024-11-09 01:16:42,286 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 01:16:42,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 245 SyntacticMatches, 21 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=285, Invalid=2144, Unknown=21, NotChecked=0, Total=2450 [2024-11-09 01:16:42,288 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 37 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:16:42,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 252 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:16:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 01:16:42,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-09 01:16:42,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 01:16:42,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2024-11-09 01:16:42,295 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 100 [2024-11-09 01:16:42,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:16:42,296 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2024-11-09 01:16:42,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 01:16:42,296 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2024-11-09 01:16:42,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 01:16:42,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:42,298 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 6, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:16:42,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 01:16:42,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 01:16:42,499 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:16:42,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:42,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1741722488, now seen corresponding path program 4 times [2024-11-09 01:16:42,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:16:42,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633577917] [2024-11-09 01:16:42,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:42,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 272 proven. 56 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-09 01:16:42,832 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:16:42,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633577917] [2024-11-09 01:16:42,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633577917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:16:42,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606624336] [2024-11-09 01:16:42,832 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 01:16:42,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:16:42,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:16:42,835 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:16:42,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 01:16:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:42,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 01:16:42,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:16:43,104 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 155 proven. 155 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-11-09 01:16:43,104 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:16:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 155 proven. 155 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-11-09 01:16:43,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606624336] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:16:43,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1618853709] [2024-11-09 01:16:43,278 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2024-11-09 01:16:43,279 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:16:43,279 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:16:43,279 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:16:43,279 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:16:44,655 INFO L197 IcfgInterpreter]: Interpreting procedure check_domain_1 with input of size 11 for LOIs [2024-11-09 01:16:44,658 INFO L197 IcfgInterpreter]: Interpreting procedure check_domain_0 with input of size 11 for LOIs [2024-11-09 01:16:44,662 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:16:48,043 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4840#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_#valid_22| (Array Int Int)) (|v_ULTIMATE.start_check_diff_~#d~0#1.base_18| Int)) (and (= (store |v_#valid_22| |v_ULTIMATE.start_check_diff_~#d~0#1.base_18| 0) |#valid|) (<= 2 |v_ULTIMATE.start_check_diff_~#d~0#1.base_18|))))' at error location [2024-11-09 01:16:48,044 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:16:48,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:16:48,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 17 [2024-11-09 01:16:48,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617502060] [2024-11-09 01:16:48,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:16:48,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 01:16:48,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:16:48,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 01:16:48,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1632, Unknown=21, NotChecked=0, Total=1806 [2024-11-09 01:16:48,046 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 states have internal predecessors, (93), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 01:16:48,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:16:48,859 INFO L93 Difference]: Finished difference Result 164 states and 186 transitions. [2024-11-09 01:16:48,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 01:16:48,860 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 states have internal predecessors, (93), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 115 [2024-11-09 01:16:48,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:16:48,861 INFO L225 Difference]: With dead ends: 164 [2024-11-09 01:16:48,861 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 01:16:48,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 288 SyntacticMatches, 26 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1981 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=573, Invalid=4376, Unknown=21, NotChecked=0, Total=4970 [2024-11-09 01:16:48,863 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 70 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:16:48,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 452 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:16:48,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 01:16:48,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2024-11-09 01:16:48,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 127 states have (on average 1.062992125984252) internal successors, (135), 127 states have internal predecessors, (135), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 01:16:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 151 transitions. [2024-11-09 01:16:48,874 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 151 transitions. Word has length 115 [2024-11-09 01:16:48,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:16:48,874 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 151 transitions. [2024-11-09 01:16:48,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 states have internal predecessors, (93), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 01:16:48,875 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 151 transitions. [2024-11-09 01:16:48,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 01:16:48,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:48,876 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 6, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:16:48,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 01:16:49,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:16:49,077 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:16:49,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:49,078 INFO L85 PathProgramCache]: Analyzing trace with hash 645641903, now seen corresponding path program 5 times [2024-11-09 01:16:49,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:16:49,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211417296] [2024-11-09 01:16:49,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:49,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:49,373 INFO L134 CoverageAnalysis]: Checked inductivity of 951 backedges. 359 proven. 29 refuted. 0 times theorem prover too weak. 563 trivial. 0 not checked. [2024-11-09 01:16:49,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:16:49,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211417296] [2024-11-09 01:16:49,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211417296] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:16:49,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099972356] [2024-11-09 01:16:49,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 01:16:49,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:16:49,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:16:49,375 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:16:49,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 01:16:49,679 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-09 01:16:49,679 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:16:49,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 01:16:49,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:16:49,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:16:49,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2024-11-09 01:16:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 951 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2024-11-09 01:16:50,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:16:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 951 backedges. 269 proven. 20 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2024-11-09 01:16:50,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099972356] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:16:50,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [216938468] [2024-11-09 01:16:50,226 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2024-11-09 01:16:50,227 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:16:50,227 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:16:50,227 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:16:50,228 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:16:51,427 INFO L197 IcfgInterpreter]: Interpreting procedure check_domain_1 with input of size 47 for LOIs [2024-11-09 01:16:51,436 INFO L197 IcfgInterpreter]: Interpreting procedure check_domain_0 with input of size 11 for LOIs [2024-11-09 01:16:51,440 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:16:56,493 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6205#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_check_diff_~#d~0#1.base_20| Int) (|v_#valid_25| (Array Int Int))) (and (= (store |v_#valid_25| |v_ULTIMATE.start_check_diff_~#d~0#1.base_20| 0) |#valid|) (<= 2 |v_ULTIMATE.start_check_diff_~#d~0#1.base_20|))))' at error location [2024-11-09 01:16:56,493 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:16:56,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:16:56,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 25 [2024-11-09 01:16:56,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019175382] [2024-11-09 01:16:56,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:16:56,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 01:16:56,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:16:56,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 01:16:56,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2312, Unknown=21, NotChecked=0, Total=2550 [2024-11-09 01:16:56,496 INFO L87 Difference]: Start difference. First operand 138 states and 151 transitions. Second operand has 25 states, 25 states have (on average 3.84) internal successors, (96), 25 states have internal predecessors, (96), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 01:16:57,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:16:57,128 INFO L93 Difference]: Finished difference Result 197 states and 219 transitions. [2024-11-09 01:16:57,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 01:16:57,132 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.84) internal successors, (96), 25 states have internal predecessors, (96), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 143 [2024-11-09 01:16:57,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:16:57,134 INFO L225 Difference]: With dead ends: 197 [2024-11-09 01:16:57,134 INFO L226 Difference]: Without dead ends: 157 [2024-11-09 01:16:57,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 345 SyntacticMatches, 43 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2888 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=637, Invalid=4312, Unknown=21, NotChecked=0, Total=4970 [2024-11-09 01:16:57,138 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 51 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:16:57,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 403 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:16:57,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-09 01:16:57,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2024-11-09 01:16:57,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 144 states have (on average 1.0625) internal successors, (153), 144 states have internal predecessors, (153), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 01:16:57,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2024-11-09 01:16:57,152 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 143 [2024-11-09 01:16:57,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:16:57,152 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2024-11-09 01:16:57,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.84) internal successors, (96), 25 states have internal predecessors, (96), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 01:16:57,153 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2024-11-09 01:16:57,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-09 01:16:57,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:57,155 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 7, 7, 7, 7, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:16:57,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 01:16:57,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:16:57,356 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:16:57,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:57,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1018722469, now seen corresponding path program 6 times [2024-11-09 01:16:57,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:16:57,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456204604] [2024-11-09 01:16:57,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:57,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:16:57,500 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:16:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:16:57,661 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 01:16:57,661 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:16:57,662 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:16:57,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 01:16:57,667 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:16:57,769 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:16:57,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:16:57 BoogieIcfgContainer [2024-11-09 01:16:57,777 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:16:57,778 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:16:57,778 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:16:57,778 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:16:57,779 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:16:24" (3/4) ... [2024-11-09 01:16:57,780 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 01:16:57,882 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/witness.graphml [2024-11-09 01:16:57,882 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:16:57,882 INFO L158 Benchmark]: Toolchain (without parser) took 34127.81ms. Allocated memory was 136.3MB in the beginning and 423.6MB in the end (delta: 287.3MB). Free memory was 95.1MB in the beginning and 363.6MB in the end (delta: -268.4MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-11-09 01:16:57,883 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 136.3MB. Free memory is still 80.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:16:57,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.70ms. Allocated memory is still 136.3MB. Free memory was 94.7MB in the beginning and 81.4MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 01:16:57,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.09ms. Allocated memory is still 136.3MB. Free memory was 81.4MB in the beginning and 79.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:16:57,883 INFO L158 Benchmark]: Boogie Preprocessor took 28.99ms. Allocated memory is still 136.3MB. Free memory was 79.3MB in the beginning and 77.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:16:57,884 INFO L158 Benchmark]: RCFGBuilder took 689.74ms. Allocated memory is still 136.3MB. Free memory was 77.5MB in the beginning and 53.7MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 01:16:57,884 INFO L158 Benchmark]: TraceAbstraction took 32884.23ms. Allocated memory was 136.3MB in the beginning and 423.6MB in the end (delta: 287.3MB). Free memory was 52.8MB in the beginning and 370.9MB in the end (delta: -318.1MB). Peak memory consumption was 204.3MB. Max. memory is 16.1GB. [2024-11-09 01:16:57,888 INFO L158 Benchmark]: Witness Printer took 103.89ms. Allocated memory is still 423.6MB. Free memory was 370.9MB in the beginning and 363.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 01:16:57,889 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 136.3MB. Free memory is still 80.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.70ms. Allocated memory is still 136.3MB. Free memory was 94.7MB in the beginning and 81.4MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.09ms. Allocated memory is still 136.3MB. Free memory was 81.4MB in the beginning and 79.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.99ms. Allocated memory is still 136.3MB. Free memory was 79.3MB in the beginning and 77.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 689.74ms. Allocated memory is still 136.3MB. Free memory was 77.5MB in the beginning and 53.7MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 32884.23ms. Allocated memory was 136.3MB in the beginning and 423.6MB in the end (delta: 287.3MB). Free memory was 52.8MB in the beginning and 370.9MB in the end (delta: -318.1MB). Peak memory consumption was 204.3MB. Max. memory is 16.1GB. * Witness Printer took 103.89ms. Allocated memory is still 423.6MB. Free memory was 370.9MB in the beginning and 363.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L58] int s, e, n, d, m, o, r, y; [L59] s = __VERIFIER_nondet_int() [L60] e = __VERIFIER_nondet_int() [L61] n = __VERIFIER_nondet_int() [L62] d = __VERIFIER_nondet_int() [L63] m = __VERIFIER_nondet_int() [L64] o = __VERIFIER_nondet_int() [L65] r = __VERIFIER_nondet_int() [L66] y = __VERIFIER_nondet_int() [L67] CALL, EXPR solve(s, e, n, d, m, o, r, y) [L46] CALL, EXPR check_domain_1(S) VAL [\old(x)=9] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; [L46] RET, EXPR check_domain_1(S) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] CALL, EXPR check_domain_0(E) VAL [\old(x)=5] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; [L46] RET, EXPR check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] CALL, EXPR check_domain_0(N) VAL [\old(x)=6] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; [L46] RET, EXPR check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_0(D) VAL [\old(x)=7] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; [L47] RET, EXPR check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_1(M) VAL [\old(x)=1] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; [L47] RET, EXPR check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_0(O) VAL [\old(x)=0] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; [L47] RET, EXPR check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L48] CALL, EXPR check_domain_0(R) VAL [\old(x)=8] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; [L48] RET, EXPR check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L48] CALL, EXPR check_domain_0(Y) VAL [\old(x)=2] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; [L48] RET, EXPR check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L51] CALL, EXPR check_diff(S, E, N, D, M, O, R, Y) [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L38] int i = 0; VAL [d={10:0}, i=0] [L38] COND FALSE !(i < 7) VAL [d={10:0}, i=0] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=0, j=1] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=0, j=1] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=0, j=1] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=2] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=0, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=0, j=2] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=3] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=0, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=0, j=3] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=4] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=0, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=0, j=4] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=5] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=0, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=0, j=5] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=6] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=0, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=0, j=6] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=7] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=0, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=0, j=7] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=8] [L39] COND TRUE j < 8 VAL [d={10:0}, i=0] [L38] i++ VAL [d={10:0}, i=1] [L38] COND FALSE !(i < 7) VAL [d={10:0}, i=1] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=1, j=2] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=1, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=1, j=2] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=3] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=1, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=1, j=3] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=4] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=1, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=1, j=4] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=5] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=1, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=1, j=5] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=6] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=1, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=1, j=6] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=7] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=1, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=1, j=7] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=8] [L39] COND TRUE j < 8 VAL [d={10:0}, i=1] [L38] i++ VAL [d={10:0}, i=2] [L38] COND FALSE !(i < 7) VAL [d={10:0}, i=2] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=2, j=3] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=2, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=2, j=3] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=4] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=2, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=2, j=4] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=5] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=2, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=2, j=5] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=6] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=2, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=2, j=6] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=7] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=2, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=2, j=7] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=8] [L39] COND TRUE j < 8 VAL [d={10:0}, i=2] [L38] i++ VAL [d={10:0}, i=3] [L38] COND FALSE !(i < 7) VAL [d={10:0}, i=3] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=3, j=4] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=3, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=3, j=4] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=5] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=3, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=3, j=5] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=6] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=3, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=3, j=6] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=7] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=3, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=3, j=7] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=8] [L39] COND TRUE j < 8 VAL [d={10:0}, i=3] [L38] i++ VAL [d={10:0}, i=4] [L38] COND FALSE !(i < 7) VAL [d={10:0}, i=4] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=4, j=5] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=4, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=4, j=5] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=4, j=6] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=4, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=4, j=6] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=4, j=7] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=4, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=4, j=7] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=4, j=8] [L39] COND TRUE j < 8 VAL [d={10:0}, i=4] [L38] i++ VAL [d={10:0}, i=5] [L38] COND FALSE !(i < 7) VAL [d={10:0}, i=5] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=5, j=6] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=5, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=5, j=6] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=5, j=7] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=5, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=5, j=7] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=5, j=8] [L39] COND TRUE j < 8 VAL [d={10:0}, i=5] [L38] i++ VAL [d={10:0}, i=6] [L38] COND FALSE !(i < 7) VAL [d={10:0}, i=6] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=6, j=7] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=6, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] VAL [d={10:0}, i=6, j=7] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=6, j=8] [L39] COND TRUE j < 8 VAL [d={10:0}, i=6] [L38] i++ VAL [d={10:0}, i=7] [L38] COND TRUE i < 7 VAL [d={10:0}] [L42] return 1; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L42] return 1; VAL [\result=1] [L51] RET, EXPR check_diff(S, E, N, D, M, O, R, Y) [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L46-L51] COND TRUE check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L52] return 1; [L67] RET, EXPR solve(s, e, n, d, m, o, r, y) [L67] CALL __VERIFIER_assert(!solve(s, e, n, d, m, o, r, y)) [L18] COND TRUE !(cond) [L20] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.7s, OverallIterations: 16, TraceHistogramMax: 28, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 229 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 229 mSDsluCounter, 3149 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2365 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 878 IncrementalHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 784 mSDtfsCounter, 878 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1585 GetRequests, 1209 SyntacticMatches, 112 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 7242 ImplicationChecksByTransitivity, 18.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=15, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 18 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1600 NumberOfCodeBlocks, 1512 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1921 ConstructedInterpolants, 0 QuantifiedInterpolants, 2957 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1462 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 25 InterpolantComputations, 11 PerfectInterpolantSequences, 4824/5622 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 01:16:57,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3cdc4a-7f3f-4f49-aafe-b538078e728c/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE