./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 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d29c75fd5928e2fd79a32667a60cd8af89d36d3bace71f12987f1807282a833 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:44:11,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:44:11,990 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 12:44:11,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:44:11,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:44:12,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:44:12,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:44:12,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:44:12,037 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:44:12,037 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:44:12,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:44:12,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:44:12,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:44:12,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:44:12,039 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:44:12,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:44:12,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:44:12,041 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:44:12,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:44:12,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:44:12,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:44:12,041 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:44:12,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:44:12,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:44:12,042 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:44:12,042 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:44:12,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:44:12,042 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:44:12,042 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:44:12,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:44:12,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:44:12,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:44:12,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:44:12,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:44:12,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:44:12,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:44:12,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:44:12,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:44:12,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:44:12,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:44:12,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:44:12,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:44:12,044 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d29c75fd5928e2fd79a32667a60cd8af89d36d3bace71f12987f1807282a833 [2024-11-13 12:44:12,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:44:12,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:44:12,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:44:12,428 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:44:12,428 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:44:12,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c Unable to find full path for "g++" [2024-11-13 12:44:14,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:44:14,675 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:44:14,676 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c [2024-11-13 12:44:14,686 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/data/1c99512d0/5ddd506465d44d45bfde331a65c793af/FLAGfb21b8110 [2024-11-13 12:44:14,704 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/data/1c99512d0/5ddd506465d44d45bfde331a65c793af [2024-11-13 12:44:14,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:44:14,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:44:14,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:44:14,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:44:14,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:44:14,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:44:14" (1/1) ... [2024-11-13 12:44:14,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2824bccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:14, skipping insertion in model container [2024-11-13 12:44:14,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:44:14" (1/1) ... [2024-11-13 12:44:14,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:44:14,918 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_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-13 12:44:14,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:44:14,981 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:44:14,992 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_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-13 12:44:15,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:44:15,043 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:44:15,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:15 WrapperNode [2024-11-13 12:44:15,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:44:15,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:44:15,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:44:15,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:44:15,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:15" (1/1) ... [2024-11-13 12:44:15,065 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:15" (1/1) ... [2024-11-13 12:44:15,109 INFO L138 Inliner]: procedures = 18, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 200 [2024-11-13 12:44:15,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:44:15,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:44:15,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:44:15,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:44:15,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:15" (1/1) ... [2024-11-13 12:44:15,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:15" (1/1) ... [2024-11-13 12:44:15,123 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:15" (1/1) ... [2024-11-13 12:44:15,151 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-13 12:44:15,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:15" (1/1) ... [2024-11-13 12:44:15,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:15" (1/1) ... [2024-11-13 12:44:15,166 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:15" (1/1) ... [2024-11-13 12:44:15,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:15" (1/1) ... [2024-11-13 12:44:15,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:15" (1/1) ... [2024-11-13 12:44:15,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:15" (1/1) ... [2024-11-13 12:44:15,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:44:15,176 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:44:15,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:44:15,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:44:15,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:15" (1/1) ... [2024-11-13 12:44:15,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:44:15,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:15,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:44:15,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:44:15,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:44:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:44:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 12:44:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 12:44:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:44:15,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:44:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 12:44:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 12:44:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_0 [2024-11-13 12:44:15,257 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_0 [2024-11-13 12:44:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_1 [2024-11-13 12:44:15,258 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_1 [2024-11-13 12:44:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 12:44:15,369 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:44:15,372 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:44:15,734 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-13 12:44:15,734 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:44:15,746 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:44:15,747 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 12:44:15,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:44:15 BoogieIcfgContainer [2024-11-13 12:44:15,747 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:44:15,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:44:15,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:44:15,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:44:15,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:44:14" (1/3) ... [2024-11-13 12:44:15,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3e07b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:44:15, skipping insertion in model container [2024-11-13 12:44:15,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:15" (2/3) ... [2024-11-13 12:44:15,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3e07b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:44:15, skipping insertion in model container [2024-11-13 12:44:15,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:44:15" (3/3) ... [2024-11-13 12:44:15,761 INFO L112 eAbstractionObserver]: Analyzing ICFG color-sendmoremoney.c [2024-11-13 12:44:15,778 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:44:15,780 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG color-sendmoremoney.c that has 3 procedures, 56 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-13 12:44:15,841 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:44:15,858 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6a3713ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:44:15,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 12:44:15,864 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 45 states have internal predecessors, (62), 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-13 12:44:15,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 12:44:15,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:15,875 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] [2024-11-13 12:44:15,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:15,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:15,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1439431559, now seen corresponding path program 1 times [2024-11-13 12:44:15,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:15,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160910523] [2024-11-13 12:44:15,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:15,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,436 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-13 12:44:16,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:16,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160910523] [2024-11-13 12:44:16,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160910523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:16,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:16,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:44:16,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24008119] [2024-11-13 12:44:16,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:16,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:44:16,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:16,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:44:16,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:44:16,474 INFO L87 Difference]: Start difference. First operand has 56 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 45 states have internal predecessors, (62), 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 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-13 12:44:16,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:16,555 INFO L93 Difference]: Finished difference Result 109 states and 152 transitions. [2024-11-13 12:44:16,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:44:16,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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 27 [2024-11-13 12:44:16,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:16,566 INFO L225 Difference]: With dead ends: 109 [2024-11-13 12:44:16,566 INFO L226 Difference]: Without dead ends: 56 [2024-11-13 12:44:16,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-13 12:44:16,575 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 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-13 12:44:16,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:16,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-13 12:44:16,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-13 12:44:16,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-13 12:44:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2024-11-13 12:44:16,621 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 27 [2024-11-13 12:44:16,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:16,622 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2024-11-13 12:44:16,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-13 12:44:16,623 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2024-11-13 12:44:16,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 12:44:16,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:16,625 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] [2024-11-13 12:44:16,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:44:16,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:16,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:16,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1610771256, now seen corresponding path program 1 times [2024-11-13 12:44:16,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:16,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239746068] [2024-11-13 12:44:16,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:16,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,712 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-13 12:44:16,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:16,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239746068] [2024-11-13 12:44:16,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239746068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:16,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:16,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:44:16,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841306650] [2024-11-13 12:44:16,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:16,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:44:16,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:16,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:44:16,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:16,714 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-13 12:44:16,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:16,751 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2024-11-13 12:44:16,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:44:16,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 27 [2024-11-13 12:44:16,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:16,755 INFO L225 Difference]: With dead ends: 61 [2024-11-13 12:44:16,755 INFO L226 Difference]: Without dead ends: 57 [2024-11-13 12:44:16,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 12:44:16,756 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:16,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:16,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-13 12:44:16,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-13 12:44:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-13 12:44:16,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2024-11-13 12:44:16,773 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 27 [2024-11-13 12:44:16,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:16,773 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2024-11-13 12:44:16,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-13 12:44:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2024-11-13 12:44:16,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-13 12:44:16,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:16,778 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] [2024-11-13 12:44:16,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:44:16,778 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:16,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:16,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1610711674, now seen corresponding path program 1 times [2024-11-13 12:44:16,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:16,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29858210] [2024-11-13 12:44:16,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:16,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:16,974 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-13 12:44:16,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:16,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29858210] [2024-11-13 12:44:16,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29858210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:16,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:16,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:44:16,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192354494] [2024-11-13 12:44:16,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:16,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:44:16,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:16,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:44:16,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:44:16,980 INFO L87 Difference]: Start difference. First operand 57 states and 77 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-13 12:44:17,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:17,012 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2024-11-13 12:44:17,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:44:17,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 27 [2024-11-13 12:44:17,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:17,016 INFO L225 Difference]: With dead ends: 61 [2024-11-13 12:44:17,016 INFO L226 Difference]: Without dead ends: 56 [2024-11-13 12:44:17,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-13 12:44:17,017 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:17,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-13 12:44:17,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-13 12:44:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-13 12:44:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2024-11-13 12:44:17,033 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 27 [2024-11-13 12:44:17,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:17,033 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2024-11-13 12:44:17,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-13 12:44:17,034 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2024-11-13 12:44:17,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 12:44:17,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:17,035 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] [2024-11-13 12:44:17,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 12:44:17,040 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:17,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:17,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1701388083, now seen corresponding path program 1 times [2024-11-13 12:44:17,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:17,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454353420] [2024-11-13 12:44:17,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:17,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,185 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-13 12:44:17,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:17,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454353420] [2024-11-13 12:44:17,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454353420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:17,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:17,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:44:17,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376345005] [2024-11-13 12:44:17,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:17,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:44:17,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:17,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:44:17,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:17,190 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-13 12:44:17,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:17,222 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2024-11-13 12:44:17,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:44:17,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 30 [2024-11-13 12:44:17,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:17,224 INFO L225 Difference]: With dead ends: 68 [2024-11-13 12:44:17,224 INFO L226 Difference]: Without dead ends: 61 [2024-11-13 12:44:17,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 12:44:17,225 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 5 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:17,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 128 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-13 12:44:17,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-13 12:44:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-13 12:44:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2024-11-13 12:44:17,233 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 30 [2024-11-13 12:44:17,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:17,234 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2024-11-13 12:44:17,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-13 12:44:17,234 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2024-11-13 12:44:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-13 12:44:17,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:17,235 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] [2024-11-13 12:44:17,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:44:17,236 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:17,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:17,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1392217499, now seen corresponding path program 1 times [2024-11-13 12:44:17,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:17,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789945030] [2024-11-13 12:44:17,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:17,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,381 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-13 12:44:17,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:17,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789945030] [2024-11-13 12:44:17,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789945030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:17,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:17,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:44:17,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070708696] [2024-11-13 12:44:17,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:17,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:44:17,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:17,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:44:17,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:44:17,383 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-13 12:44:17,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:17,431 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2024-11-13 12:44:17,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:44:17,432 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), 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 31 [2024-11-13 12:44:17,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:17,433 INFO L225 Difference]: With dead ends: 71 [2024-11-13 12:44:17,433 INFO L226 Difference]: Without dead ends: 57 [2024-11-13 12:44:17,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-13 12:44:17,434 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:17,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:17,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-13 12:44:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-13 12:44:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-13 12:44:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2024-11-13 12:44:17,441 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 31 [2024-11-13 12:44:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:17,442 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2024-11-13 12:44:17,442 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), 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-13 12:44:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2024-11-13 12:44:17,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-13 12:44:17,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:17,443 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, 1, 1, 1, 1] [2024-11-13 12:44:17,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 12:44:17,444 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:17,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:17,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1362858011, now seen corresponding path program 1 times [2024-11-13 12:44:17,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:17,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256947802] [2024-11-13 12:44:17,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:17,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:44:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,554 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-13 12:44:17,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:17,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256947802] [2024-11-13 12:44:17,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256947802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:17,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:17,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:44:17,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723088186] [2024-11-13 12:44:17,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:17,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:44:17,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:17,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:44:17,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:44:17,558 INFO L87 Difference]: Start difference. First operand 57 states and 74 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, (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-13 12:44:17,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:17,604 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2024-11-13 12:44:17,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:44:17,605 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, (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 37 [2024-11-13 12:44:17,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:17,607 INFO L225 Difference]: With dead ends: 79 [2024-11-13 12:44:17,609 INFO L226 Difference]: Without dead ends: 57 [2024-11-13 12:44:17,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-13 12:44:17,611 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:17,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:17,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-13 12:44:17,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-13 12:44:17,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-13 12:44:17,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 73 transitions. [2024-11-13 12:44:17,620 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 73 transitions. Word has length 37 [2024-11-13 12:44:17,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:17,620 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 73 transitions. [2024-11-13 12:44:17,621 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, (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-13 12:44:17,621 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 73 transitions. [2024-11-13 12:44:17,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 12:44:17,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:17,626 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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] [2024-11-13 12:44:17,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 12:44:17,626 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:17,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:17,626 INFO L85 PathProgramCache]: Analyzing trace with hash -643702998, now seen corresponding path program 1 times [2024-11-13 12:44:17,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:17,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173736053] [2024-11-13 12:44:17,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:17,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-13 12:44:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:44:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 12:44:17,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:17,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173736053] [2024-11-13 12:44:17,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173736053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:17,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:17,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:44:17,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256833062] [2024-11-13 12:44:17,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:17,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:44:17,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:17,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:44:17,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:44:17,756 INFO L87 Difference]: Start difference. First operand 57 states and 73 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, (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-13 12:44:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:17,795 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2024-11-13 12:44:17,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:44:17,796 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, (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 43 [2024-11-13 12:44:17,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:17,796 INFO L225 Difference]: With dead ends: 83 [2024-11-13 12:44:17,797 INFO L226 Difference]: Without dead ends: 57 [2024-11-13 12:44:17,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-13 12:44:17,799 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:17,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-13 12:44:17,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-13 12:44:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-13 12:44:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2024-11-13 12:44:17,813 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 43 [2024-11-13 12:44:17,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:17,813 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2024-11-13 12:44:17,813 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, (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-13 12:44:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2024-11-13 12:44:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 12:44:17,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:17,818 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 12:44:17,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 12:44:17,818 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:17,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:17,821 INFO L85 PathProgramCache]: Analyzing trace with hash 442072426, now seen corresponding path program 1 times [2024-11-13 12:44:17,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:17,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002506697] [2024-11-13 12:44:17,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:17,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 12:44:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 12:44:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 12:44:17,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:17,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002506697] [2024-11-13 12:44:17,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002506697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:17,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:17,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:44:17,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990828706] [2024-11-13 12:44:17,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:17,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:44:17,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:17,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:44:17,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:44:17,945 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 12:44:17,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:17,981 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2024-11-13 12:44:17,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:44:17,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2024-11-13 12:44:17,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:17,982 INFO L225 Difference]: With dead ends: 87 [2024-11-13 12:44:17,983 INFO L226 Difference]: Without dead ends: 57 [2024-11-13 12:44:17,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-13 12:44:17,987 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:17,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:17,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-13 12:44:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-13 12:44:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-13 12:44:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2024-11-13 12:44:17,999 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 49 [2024-11-13 12:44:17,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:17,999 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2024-11-13 12:44:17,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 12:44:17,999 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2024-11-13 12:44:18,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-13 12:44:18,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:18,003 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 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] [2024-11-13 12:44:18,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 12:44:18,004 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:18,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:18,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1487120149, now seen corresponding path program 1 times [2024-11-13 12:44:18,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:18,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851849463] [2024-11-13 12:44:18,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:18,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-13 12:44:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-13 12:44:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-13 12:44:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 12:44:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,152 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 12:44:18,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:18,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851849463] [2024-11-13 12:44:18,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851849463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:18,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:18,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:44:18,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239654882] [2024-11-13 12:44:18,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:18,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:44:18,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:18,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:44:18,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:44:18,157 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-13 12:44:18,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:18,193 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2024-11-13 12:44:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:44:18,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 55 [2024-11-13 12:44:18,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:18,194 INFO L225 Difference]: With dead ends: 97 [2024-11-13 12:44:18,195 INFO L226 Difference]: Without dead ends: 57 [2024-11-13 12:44:18,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-13 12:44:18,197 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:18,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:18,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-13 12:44:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-13 12:44:18,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-13 12:44:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2024-11-13 12:44:18,209 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 55 [2024-11-13 12:44:18,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:18,209 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2024-11-13 12:44:18,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-13 12:44:18,209 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2024-11-13 12:44:18,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 12:44:18,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:18,214 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 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] [2024-11-13 12:44:18,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 12:44:18,214 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:18,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:18,215 INFO L85 PathProgramCache]: Analyzing trace with hash 850737953, now seen corresponding path program 1 times [2024-11-13 12:44:18,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:18,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813699141] [2024-11-13 12:44:18,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:18,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-13 12:44:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:44:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-13 12:44:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 12:44:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-13 12:44:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,363 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 12:44:18,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:18,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813699141] [2024-11-13 12:44:18,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813699141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:18,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:18,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:44:18,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114987506] [2024-11-13 12:44:18,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:18,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:44:18,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:18,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:44:18,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:44:18,366 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-13 12:44:18,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:18,395 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2024-11-13 12:44:18,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:44:18,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 61 [2024-11-13 12:44:18,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:18,397 INFO L225 Difference]: With dead ends: 101 [2024-11-13 12:44:18,398 INFO L226 Difference]: Without dead ends: 57 [2024-11-13 12:44:18,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-13 12:44:18,400 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:18,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:18,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-13 12:44:18,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-13 12:44:18,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-13 12:44:18,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2024-11-13 12:44:18,412 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 61 [2024-11-13 12:44:18,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:18,412 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2024-11-13 12:44:18,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-13 12:44:18,412 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2024-11-13 12:44:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-13 12:44:18,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:18,413 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 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] [2024-11-13 12:44:18,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 12:44:18,414 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:18,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:18,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1558393426, now seen corresponding path program 1 times [2024-11-13 12:44:18,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:18,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042837552] [2024-11-13 12:44:18,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:18,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 12:44:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-13 12:44:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:44:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-13 12:44:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:44:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-13 12:44:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-13 12:44:18,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:18,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042837552] [2024-11-13 12:44:18,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042837552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:18,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:18,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:44:18,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820970887] [2024-11-13 12:44:18,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:18,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:44:18,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:18,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:44:18,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:44:18,572 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-13 12:44:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:18,604 INFO L93 Difference]: Finished difference Result 105 states and 125 transitions. [2024-11-13 12:44:18,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:44:18,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 67 [2024-11-13 12:44:18,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:18,605 INFO L225 Difference]: With dead ends: 105 [2024-11-13 12:44:18,605 INFO L226 Difference]: Without dead ends: 57 [2024-11-13 12:44:18,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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-13 12:44:18,606 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:18,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:18,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-13 12:44:18,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2024-11-13 12:44:18,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 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-13 12:44:18,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2024-11-13 12:44:18,615 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 67 [2024-11-13 12:44:18,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:18,619 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2024-11-13 12:44:18,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-13 12:44:18,619 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2024-11-13 12:44:18,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 12:44:18,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:18,620 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 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-13 12:44:18,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 12:44:18,620 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:18,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:18,621 INFO L85 PathProgramCache]: Analyzing trace with hash 259412221, now seen corresponding path program 1 times [2024-11-13 12:44:18,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:18,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626489942] [2024-11-13 12:44:18,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:18,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 12:44:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 12:44:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 12:44:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:44:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 12:44:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-13 12:44:18,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:18,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626489942] [2024-11-13 12:44:18,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626489942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:18,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:18,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:44:18,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090987143] [2024-11-13 12:44:18,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:18,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:44:18,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:18,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:44:18,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:44:18,828 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-13 12:44:18,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:18,858 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2024-11-13 12:44:18,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:44:18,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 73 [2024-11-13 12:44:18,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:18,861 INFO L225 Difference]: With dead ends: 59 [2024-11-13 12:44:18,861 INFO L226 Difference]: Without dead ends: 53 [2024-11-13 12:44:18,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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-13 12:44:18,862 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:18,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:18,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-13 12:44:18,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-13 12:44:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 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-13 12:44:18,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2024-11-13 12:44:18,871 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 73 [2024-11-13 12:44:18,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:18,875 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-11-13 12:44:18,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-13 12:44:18,875 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2024-11-13 12:44:18,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 12:44:18,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:18,876 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 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] [2024-11-13 12:44:18,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 12:44:18,877 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:18,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:18,877 INFO L85 PathProgramCache]: Analyzing trace with hash 422676606, now seen corresponding path program 1 times [2024-11-13 12:44:18,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:18,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280690280] [2024-11-13 12:44:18,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:18,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 12:44:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 12:44:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 12:44:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:44:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 12:44:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-13 12:44:19,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:19,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280690280] [2024-11-13 12:44:19,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280690280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:19,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:19,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:44:19,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482422339] [2024-11-13 12:44:19,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:19,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:44:19,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:19,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:44:19,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:44:19,064 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-13 12:44:19,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:19,101 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2024-11-13 12:44:19,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:44:19,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 75 [2024-11-13 12:44:19,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:19,103 INFO L225 Difference]: With dead ends: 69 [2024-11-13 12:44:19,103 INFO L226 Difference]: Without dead ends: 58 [2024-11-13 12:44:19,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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-13 12:44:19,103 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 5 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:19,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 163 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:19,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-13 12:44:19,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2024-11-13 12:44:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 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-13 12:44:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2024-11-13 12:44:19,110 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 75 [2024-11-13 12:44:19,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:19,111 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2024-11-13 12:44:19,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-13 12:44:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2024-11-13 12:44:19,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-13 12:44:19,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:19,112 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 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-13 12:44:19,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 12:44:19,113 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:19,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:19,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1249830375, now seen corresponding path program 1 times [2024-11-13 12:44:19,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:19,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405759068] [2024-11-13 12:44:19,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:19,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 12:44:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 12:44:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 12:44:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:44:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 12:44:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-13 12:44:19,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:19,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405759068] [2024-11-13 12:44:19,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405759068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:19,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507144024] [2024-11-13 12:44:19,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:19,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:19,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:19,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:19,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 12:44:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:19,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 12:44:19,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:19,539 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-13 12:44:19,539 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:44:19,639 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-13 12:44:19,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507144024] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:44:19,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:44:19,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-11-13 12:44:19,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121514458] [2024-11-13 12:44:19,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:44:19,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:44:19,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:19,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:44:19,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:44:19,641 INFO L87 Difference]: Start difference. First operand 54 states and 63 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-13 12:44:19,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:19,825 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2024-11-13 12:44:19,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:44:19,826 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 77 [2024-11-13 12:44:19,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:19,827 INFO L225 Difference]: With dead ends: 91 [2024-11-13 12:44:19,827 INFO L226 Difference]: Without dead ends: 80 [2024-11-13 12:44:19,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:44:19,828 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 31 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:19,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 326 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:19,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-13 12:44:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-11-13 12:44:19,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 65 states have internal predecessors, (71), 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-13 12:44:19,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2024-11-13 12:44:19,839 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 77 [2024-11-13 12:44:19,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:19,840 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2024-11-13 12:44:19,840 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-13 12:44:19,840 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2024-11-13 12:44:19,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 12:44:19,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:19,842 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 6, 6, 6, 3, 3, 3, 2, 2, 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] [2024-11-13 12:44:19,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 12:44:20,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:20,043 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:20,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:20,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1520109199, now seen corresponding path program 2 times [2024-11-13 12:44:20,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:20,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426231657] [2024-11-13 12:44:20,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:20,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 12:44:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 12:44:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 12:44:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:44:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 12:44:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 58 proven. 16 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-13 12:44:20,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:20,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426231657] [2024-11-13 12:44:20,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426231657] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:20,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843887968] [2024-11-13 12:44:20,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:44:20,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:20,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:20,364 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:20,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 12:44:20,629 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:44:20,629 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:44:20,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 12:44:20,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 58 proven. 16 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-13 12:44:20,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:44:20,882 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 58 proven. 16 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-13 12:44:20,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843887968] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:44:20,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:44:20,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-11-13 12:44:20,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912049699] [2024-11-13 12:44:20,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:44:20,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 12:44:20,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:20,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 12:44:20,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=167, Unknown=0, NotChecked=0, Total=272 [2024-11-13 12:44:20,888 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 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-13 12:44:21,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:21,111 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2024-11-13 12:44:21,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 12:44:21,112 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 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 99 [2024-11-13 12:44:21,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:21,113 INFO L225 Difference]: With dead ends: 112 [2024-11-13 12:44:21,113 INFO L226 Difference]: Without dead ends: 87 [2024-11-13 12:44:21,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 203 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=358, Unknown=0, NotChecked=0, Total=552 [2024-11-13 12:44:21,116 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 32 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:21,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 324 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:21,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-13 12:44:21,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-11-13 12:44:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.08) internal successors, (81), 75 states have internal predecessors, (81), 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-13 12:44:21,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2024-11-13 12:44:21,127 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 99 [2024-11-13 12:44:21,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:21,128 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2024-11-13 12:44:21,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 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-13 12:44:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2024-11-13 12:44:21,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-13 12:44:21,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:21,130 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 6, 6, 6, 3, 3, 3, 2, 2, 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] [2024-11-13 12:44:21,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 12:44:21,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-13 12:44:21,331 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:21,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:21,331 INFO L85 PathProgramCache]: Analyzing trace with hash -117400982, now seen corresponding path program 3 times [2024-11-13 12:44:21,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:21,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699063408] [2024-11-13 12:44:21,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:21,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 12:44:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 12:44:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 12:44:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:44:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 12:44:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-13 12:44:21,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:21,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699063408] [2024-11-13 12:44:21,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699063408] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:21,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410971650] [2024-11-13 12:44:21,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 12:44:21,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:21,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:21,550 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:21,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 12:44:21,771 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-13 12:44:21,771 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:44:21,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 12:44:21,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-13 12:44:21,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:44:21,919 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-13 12:44:21,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410971650] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:21,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-13 12:44:21,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 8 [2024-11-13 12:44:21,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279894921] [2024-11-13 12:44:21,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:21,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:44:21,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:21,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:44:21,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:44:21,921 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-13 12:44:21,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:21,985 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2024-11-13 12:44:21,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:44:21,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 109 [2024-11-13 12:44:21,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:21,986 INFO L225 Difference]: With dead ends: 98 [2024-11-13 12:44:21,986 INFO L226 Difference]: Without dead ends: 91 [2024-11-13 12:44:21,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 230 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:44:21,987 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 5 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:21,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 214 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:44:21,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-13 12:44:21,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-13 12:44:21,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.0875) internal successors, (87), 80 states have internal predecessors, (87), 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-13 12:44:21,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2024-11-13 12:44:21,995 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 109 [2024-11-13 12:44:21,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:21,996 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2024-11-13 12:44:21,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-13 12:44:21,996 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2024-11-13 12:44:21,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 12:44:21,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:21,997 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 6, 6, 6, 4, 4, 4, 2, 2, 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] [2024-11-13 12:44:22,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 12:44:22,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 12:44:22,201 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:22,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:22,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1500694240, now seen corresponding path program 4 times [2024-11-13 12:44:22,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:22,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494163744] [2024-11-13 12:44:22,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:22,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 12:44:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 12:44:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 12:44:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:44:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 12:44:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 198 proven. 41 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-13 12:44:22,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:22,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494163744] [2024-11-13 12:44:22,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494163744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:22,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754359200] [2024-11-13 12:44:22,560 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 12:44:22,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:22,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:22,562 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:22,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 12:44:22,742 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 12:44:22,742 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:44:22,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 12:44:22,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:22,934 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 152 proven. 121 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-13 12:44:22,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:44:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 165 proven. 108 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-13 12:44:23,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754359200] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:44:23,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:44:23,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 26 [2024-11-13 12:44:23,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176807259] [2024-11-13 12:44:23,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:44:23,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-13 12:44:23,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:23,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-13 12:44:23,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2024-11-13 12:44:23,375 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 26 states, 26 states have (on average 3.730769230769231) internal successors, (97), 26 states have internal predecessors, (97), 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-13 12:44:24,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:24,091 INFO L93 Difference]: Finished difference Result 165 states and 198 transitions. [2024-11-13 12:44:24,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-13 12:44:24,092 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.730769230769231) internal successors, (97), 26 states have internal predecessors, (97), 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 114 [2024-11-13 12:44:24,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:24,093 INFO L225 Difference]: With dead ends: 165 [2024-11-13 12:44:24,093 INFO L226 Difference]: Without dead ends: 144 [2024-11-13 12:44:24,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 222 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=713, Invalid=2257, Unknown=0, NotChecked=0, Total=2970 [2024-11-13 12:44:24,095 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 44 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:24,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 580 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:44:24,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-13 12:44:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 114. [2024-11-13 12:44:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 103 states have (on average 1.0970873786407767) internal successors, (113), 103 states have internal predecessors, (113), 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-13 12:44:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2024-11-13 12:44:24,108 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 114 [2024-11-13 12:44:24,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:24,108 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2024-11-13 12:44:24,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.730769230769231) internal successors, (97), 26 states have internal predecessors, (97), 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-13 12:44:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2024-11-13 12:44:24,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-13 12:44:24,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:24,110 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 6, 6, 6, 5, 5, 5, 2, 2, 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] [2024-11-13 12:44:24,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 12:44:24,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 12:44:24,311 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:24,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:24,311 INFO L85 PathProgramCache]: Analyzing trace with hash -798689073, now seen corresponding path program 5 times [2024-11-13 12:44:24,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:24,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868815334] [2024-11-13 12:44:24,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:24,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-13 12:44:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-13 12:44:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 12:44:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-13 12:44:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 12:44:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-13 12:44:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:44:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-13 12:44:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 262 proven. 22 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-13 12:44:24,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:24,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868815334] [2024-11-13 12:44:24,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868815334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:24,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641204056] [2024-11-13 12:44:24,602 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 12:44:24,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:24,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:24,605 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:24,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 12:44:24,840 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-13 12:44:24,841 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:44:24,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 12:44:24,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:24,984 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 306 proven. 257 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-13 12:44:24,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:44:25,283 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 324 proven. 239 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-13 12:44:25,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641204056] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:44:25,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:44:25,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 19 [2024-11-13 12:44:25,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579208972] [2024-11-13 12:44:25,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:44:25,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-13 12:44:25,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:25,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-13 12:44:25,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-11-13 12:44:25,286 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 19 states have internal predecessors, (87), 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-13 12:44:25,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:25,727 INFO L93 Difference]: Finished difference Result 185 states and 210 transitions. [2024-11-13 12:44:25,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-13 12:44:25,728 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 19 states have internal predecessors, (87), 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 133 [2024-11-13 12:44:25,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:44:25,729 INFO L225 Difference]: With dead ends: 185 [2024-11-13 12:44:25,729 INFO L226 Difference]: Without dead ends: 126 [2024-11-13 12:44:25,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 267 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=418, Invalid=1142, Unknown=0, NotChecked=0, Total=1560 [2024-11-13 12:44:25,731 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 17 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:44:25,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 422 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:44:25,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-13 12:44:25,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-13 12:44:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 115 states have (on average 1.0869565217391304) internal successors, (125), 115 states have internal predecessors, (125), 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-13 12:44:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 141 transitions. [2024-11-13 12:44:25,746 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 141 transitions. Word has length 133 [2024-11-13 12:44:25,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:44:25,746 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 141 transitions. [2024-11-13 12:44:25,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.578947368421052) internal successors, (87), 19 states have internal predecessors, (87), 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-13 12:44:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2024-11-13 12:44:25,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 12:44:25,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:44:25,748 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 7, 7, 7, 6, 6, 6, 2, 2, 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] [2024-11-13 12:44:25,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-13 12:44:25,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 12:44:25,952 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:44:25,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:25,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1506856502, now seen corresponding path program 6 times [2024-11-13 12:44:25,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:25,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320658809] [2024-11-13 12:44:25,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:25,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:44:26,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:44:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:44:26,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:44:26,387 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 12:44:26,388 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 12:44:26,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 12:44:26,394 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:44:26,487 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 12:44:26,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 12:44:26 BoogieIcfgContainer [2024-11-13 12:44:26,495 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 12:44:26,496 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 12:44:26,496 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 12:44:26,497 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 12:44:26,497 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:44:15" (3/4) ... [2024-11-13 12:44:26,498 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 12:44:26,584 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 12:44:26,584 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 12:44:26,586 INFO L158 Benchmark]: Toolchain (without parser) took 11876.09ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 92.1MB in the beginning and 100.8MB in the end (delta: -8.7MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2024-11-13 12:44:26,586 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 83.9MB. Free memory is still 41.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:44:26,587 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.61ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 79.9MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:44:26,587 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.59ms. Allocated memory is still 117.4MB. Free memory was 79.9MB in the beginning and 78.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:44:26,587 INFO L158 Benchmark]: Boogie Preprocessor took 65.72ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 76.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:44:26,589 INFO L158 Benchmark]: RCFGBuilder took 571.36ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 58.4MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 12:44:26,591 INFO L158 Benchmark]: TraceAbstraction took 10745.62ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 57.9MB in the beginning and 107.7MB in the end (delta: -49.8MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. [2024-11-13 12:44:26,591 INFO L158 Benchmark]: Witness Printer took 88.06ms. Allocated memory is still 151.0MB. Free memory was 106.3MB in the beginning and 100.8MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:44:26,598 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.48ms. Allocated memory is still 83.9MB. Free memory is still 41.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.61ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 79.9MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.59ms. Allocated memory is still 117.4MB. Free memory was 79.9MB in the beginning and 78.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.72ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 76.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 571.36ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 58.4MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10745.62ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 57.9MB in the beginning and 107.7MB in the end (delta: -49.8MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. * Witness Printer took 88.06ms. Allocated memory is still 151.0MB. Free memory was 106.3MB in the beginning and 100.8MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. 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; VAL [\old(x)=9, \result=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; VAL [\old(x)=5, \result=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; VAL [\old(x)=6, \result=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; VAL [\old(x)=7, \result=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; VAL [\old(x)=1, \result=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; VAL [\old(x)=0, \result=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; VAL [\old(x)=8, \result=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; VAL [\old(x)=2, \result=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) 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}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {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 TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=0, j=1] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=0] [L38] i++ 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 TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=1] [L38] i++ 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 TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=2] [L38] i++ 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 TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=3] [L38] i++ 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 TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=4, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=4, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=4, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=4] [L38] i++ 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 TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=5, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=5, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=5] [L38] i++ 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 TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=6, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=6] [L38] i++ VAL [d={10:0}, i=7] [L38] COND FALSE !(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; VAL [\result=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, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 19, TraceHistogramMax: 28, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 139 mSDsluCounter, 4225 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3089 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 584 IncrementalHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 1136 mSDtfsCounter, 584 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1391 GetRequests, 1209 SyntacticMatches, 19 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=18, InterpolantAutomatonStates: 155, 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, 18 MinimizatonAttempts, 47 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1815 NumberOfCodeBlocks, 1755 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 2170 ConstructedInterpolants, 0 QuantifiedInterpolants, 2907 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1651 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 4239/5084 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-13 12:44:26,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb3ac9da-c2b0-4ef0-b38e-9c37cb3c6b2d/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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